Abstract

To achieve the promising potentials by using tremendous distributed resources, effective and efficient scheduling algorithms are fundamentally important. Scheduling such applications is challenging because target resources are heterogeneous, their load and availability varies dynamically. Previous parallel system was assumed to be organized with homogeneous platform and connected via memory, bus, or LAN. But today its platform is heterogeneous and connected via Internet so each platform has different ability of computation performance and different network bandwidth. So, traditional list scheduling algorithms are inefficient to current parallel system. This research paper proposes and discusses in detail, the two new algorithms for Job scheduling on computational Grids so that the jobs are executed in minimum time and also all nodes of Grid execute equal load relative to their executing power. The main objective of this research paper is to allocate all the incoming jobs to the available computing power.

References

• I. Foster, and C. Kesselman. 2004. The Grid 2: Blueprint for a New Computing Infrastructure, Second Edition, Elsevier and Morgan Kaufmann Press.
• I. Foster and C. Kesselman (editors). 1999. The Grid: Blueprint for a Future Computing Infrastructure, Morgan Kaufmann Publishers, USA.
• Rajkummar Buyya. 2002. Economic-based Distributed Resource Management and Scheduling for grid computing. PhD thesis, Monash university, Melborn, Australia.
• K. Al-Saqabi, S. Sarwar, and K. Saleh. 1997. Distributed gang scheduling in networks of heterogeneous workstations, Computer Communications Journal, pp. 338-348.
• Maheswaran M, Ali S, Siegel H J, et al. 1999. Dynamic mapping of a class of independent tasks on to heterogeneous computing systems. In the 8th IEEE Heterogeneous Computing Workshop (HCW '99),San Juan, Puerto Rico,(Apr. 1999), pp. 30-44.
• XiaoShan He, XianHe Sun, and Gregor von Laszewski. 2003. QoS Guided Min-Min Heuristic for Grid Task Scheduling, Computer Science and Technology, 18(4):442-451.
• X. He, X-He Sun, and G. V. Laszewski. 2003. QoS Guided Min-min Heuristic for Grid Task Scheduling, Journal of Computer Science and Technology, Vol. 18, pp. 442-451.
• M. Maheswaran, Sh. Ali, H. Jay Siegel, D. Hensgen, and R. F. Freund. 1999. Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems, Journal of Parallel and Distributed Computing, Vol. 59, pp. 107-13.
• T. D. Braun, H. Jay Siegel, N. Beck, L. L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, and B. Yao. 2001. A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems,Journal of Parallel and Distributed Computing, Vol. 61, pp. 810-837.
• F. Dong, J. Luo, L. Gao, and L. Ge. 2006. A Grid Task Scheduling Algorithm Based on QoS Priority Grouping," In the Proceedings of the Fifth International Conference on Grid and Cooperative Computing (GCC'06), IEEE.
• E. Ullah Munir, J. Li, and Sh. Shi. 2007. QoS Sufferage Heuristic for Independent Task Scheduling in Grid. Information Technology Journal, 6 (8): 1166-1170.
• K. Etminani, and M. Naghibzadeh. 2007. A Min-min Max-min Selective Algorithm for Grid Task Scheduling,The Third IEEE/IFIP International Conference on Internet, Uzbekistan.
• B. T. Benjamin Khoo, B. Veeravalli, T. Hung, and C. W. Simon See. 2007. A multi-dimensional scheduling scheme in a Grid computing environment," Journal of Parallel and Distributed Computing, Vol. 67, pp. 659-673.
• B. Yagoubi, and Y. Slimani. 2007. Task Load Balancing Strategy for Grid Computing, Journal of Computer Science, Vol. 3, No. 3, pp. 186-194.
• Huyn zhang, chanle wu, Q. xiong, and L. Wu,G. Ye. 2006. Research on an Effective Mechanism of Task Scheduling in Grid Environment. In IEEE, Fifth International Conference on Grid and Cooperative Computing (GCC'06).
• E. Elmroth, and J. Tordsson. 2008. Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions," Journal of Future Generation Computer Systems, Vol. 24, pp. 585-593.
• F. Dong, J. Luo, L. Gao, and L. Ge. 2006. A Grid Task Scheduling Algorithm Based on QoS Priority Grouping," In the Proceedings of the Fifth International Conference on Grid and Cooperative Computing (GCC'06), IEEE.
• B. Yagoubi, and Y. Slimani. 2007. Task Load Balancing Strategy for Grid Computing," Journal of Computer Science, Vol. 3, No. 3, pp. 186-194.