A Heuristic on Job Scheduling in Grid Computing Environment

This paper introduces a model and a job scheduling algorithm in grid computing environments. In grid computing several applications require numerous resources for execution which are not often available for them, thus presence of a scheduling system to allocate resources to input jobs is vital. The resource selection criteria in the proposed algorithm are based on input jobs, communication links and resource computational capability. Then, the proposed algorithm will be assessed in simulated grid environment with statistical patterns of job insertion into system which each of them follow the normal, Poisson and exponential distribution. The results show that the new proposed algorithm has a better efficiency in comparison with the results obtained from other known algorithms.

[1]  Simon See,et al.  Performance Investigation of Weighted Meta-scheduling Algorithm for Scientific Grid , 2005, GCC.

[2]  Rajkumar Buyya,et al.  GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing , 2002, Concurr. Comput. Pract. Exp..

[3]  Srikumar Venugopal,et al.  A Set Coverage-based Mapping Heuristic for Scheduling Distributed Data-Intensive Applications on Global Grids , 2006, 2006 7th IEEE/ACM International Conference on Grid Computing.

[4]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[5]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[6]  Huyin Zhang,et al.  Research on an Effective Mechanism of Task-scheduling in Grid Environment , 2006, 2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06).

[7]  Richard McClatchey,et al.  DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling , 2006, e-Science.

[8]  Rajkumar Buyya,et al.  Economic-based Distributed Resource Management and Scheduling for Grid Computing , 2002, ArXiv.

[9]  Rajkumar Buyya,et al.  A Dynamic Job Grouping-Based Scheduling for Deploying Applications with Fine-Grained Tasks on Global Grids , 2005, ACSW.

[10]  Gregor von Laszewski,et al.  QoS guided Min-Min heuristic for grid task scheduling , 2003, Journal of Computer Science and Technology.

[11]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[12]  Tao Wang,et al.  An Adaptive Resource Scheduling Algorithm for Computational Grid , 2006, 2006 IEEE Asia-Pacific Conference on Services Computing (APSCC'06).

[13]  Kassem Saleh,et al.  Distributed gang scheduling in networks of heterogenous workstations , 1997, Comput. Commun..

[14]  Satish K. Tripathi,et al.  Static and Dynamic Processor Scheduling Disciplines in Heterogeneous Parallel Architectures , 1995, J. Parallel Distributed Comput..

[15]  R. F. Freund,et al.  Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[16]  Francisco Vilar Brasileiro,et al.  Trading Cycles for Information: Using Replication to Schedule Bag-of-Tasks Applications on Computational Grids , 2003, Euro-Par.

[17]  Maozhen Li,et al.  The grid - core technologies , 2005 .

[18]  Ami Marowka,et al.  What is the GRID? , 2002, Scalable Comput. Pract. Exp..

[19]  Kenichi Hagihara,et al.  A comparison among grid scheduling algorithms for independent coarse-grained tasks , 2004, 2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops..