An On-line Scheduling Algorithm for a GRID System

GRID시스템을 위한 온라인 스케줄링 알고리즘

  • 김학두 (한국전자통신연구원) ;
  • 김진석 (서울시립대학교 컴퓨터과학) ;
  • 박형우 (KISTI 슈퍼컴퓨팅센터 그리드 연구실장)
  • Published : 2004.02.01

Abstract

The scheduling problem that maps independent tasks to heterogeneous resources in distributed computing systems is known as NP-complete[1]. GRID[2] is an example of distributed systems that consisted of heterogeneous resources. Many algorithms to solve this problem have been presented[1,3,4,5]. The scheduling algorithm can be classified into static scheduling algorithms and dynmic scheduling algorithms. A dynamic scheduling algorithm can be used when we can not predict the priority of tasks. Moreover, a dynamic scheduling algorithm can be divided into on-line mode algorithm and batch mode algorithm according to the scheduling time[1,6]. In this paper, we propose a new on-line mode scheduling algorithm. By extensive simulation, we can see that our scheduling algorithm outperforms previous scheduling algorithms.

References

  1. O. H. Ibarra and C. E. Kim, 'Heuristic Algorithm for Scheduling Independent Tasks on Nonidentical Processors,' Journal of the ACM, vol. 24, no. 2, pp. 280-289, April, 1977 https://doi.org/10.1145/322003.322011
  2. I. Foster, C. Kesselman, and S. Tuecke, 'The Anatomy of the Grid: Enabling Scalable Virtual Organizations,' Journal of High-Performance Computing Applications, vol. 15, no. 3, pp. 200-222, 2001 https://doi.org/10.1177/109434200101500302
  3. R. Buyya, J. Giddy, and D. Abramson, 'An Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications,' Proc. of the 2nd International Workshop on Active Middleware Services, August, 2000
  4. H. Barada, S. M. Sait, and N. Baig, 'Task Matching and Scheduling in Heterogeneous Systems using Simulated Evolution,' Proc. of the 15th Parallel and Distributed Processing Symposium, pp. 875-882, 2001
  5. B. Hamidzadeh, Lau Ying Kit, and D.J. Lilja, 'Dynamic Task Scheduling using Online Optimization,' Journal of Parallel and Distributed Systems, vol. 11, pp. 1151 -1163, 2000 https://doi.org/10.1109/71.888636
  6. M. Maheswaran, T. D. Braun, and H. J. Siegel, 'Heterogeneous Distributed Computing,' Encyclopedia of Electrical and Electronics Engineering, J. G. Wdbster, editor, John Wiley & Sons, vol. 8, pp. 679-690, 1999
  7. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice Hall, NJ, 1995
  8. M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund, 'Dynamic Matching and Scheduling of a Class of Indenpendent Tasks onto Heterogeneous Computing Systems,' Proc. of the 8th Heterogeneous Computing Workshop, pp. 3044, April, 1999 https://doi.org/10.1109/HCW.1999.765094
  9. F. Howell and R. McNab, 'Simjava: A Discrete Event Simulation Package For Java With Applications In Computer Systems Modelling,' Proc. of the 1st International Conference on Web-based Modelling and Simulation, January, 1998
  10. A. A. Khokhar, V. K. Prasanna, M. E. Shaaban, and C. L. Wang, 'Heterogeneous Computing: Challenges and Opportunities,' Journal of the IEEE Computer, vol. 26, pp. 18-27, June, 1993 https://doi.org/10.1109/2.214439
  11. T. D. Braun, H. J. Siegel, and Noah Beck, 'A Comparison of Eleven Static Heuristics for Map' ping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems,' Journal of Parallel and Distributed Computing, vol. 61, pp. 810-837, 2001 https://doi.org/10.1006/jpdc.2000.1714