A Co-ordinate Based Resource Allocation Strategy for Grid Environments

In this paper, we propose a novel resource scheduling strategy, referred to as the Multi-Resource Scheduling (MRS) algorithm, which is capable of handling several resources to be used among jobs that arrive at a Grid Computing Environment. We propose a model in which the job and resource characteristics are captured together and are used in the scheduling strategy. To do so, we introduce the concept of virtual map and resource potential. Based on the proposed model, simulations with realistic workload traces were conducted to quantify the performance. We compare our strategy with some of the commonly used algorithms, and show that MRS renders a higher performance in all cases. Our experimental results clearly show that MRS outperforms other strategies and we highlight the impact and importance of our strategy.

[1]  Ian T. Foster,et al.  MPICH-G2: A Grid-enabled implementation of the Message Passing Interface , 2002, J. Parallel Distributed Comput..

[2]  David P. Anderson,et al.  SETI@home-massively distributed computing for SETI , 2001, Comput. Sci. Eng..

[3]  Uwe Schwiegelshohn,et al.  On Advantages of Grid Computing for Parallel Job Scheduling , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[4]  V. Kumar,et al.  Job Scheduling in the presence of Multiple Resource Requirements , 1999, ACM/IEEE SC 1999 Conference (SC'99).

[5]  Stephen John Turner,et al.  The design and implementation of an OGSA-based grid information service , 2004, Proceedings. IEEE International Conference on Web Services, 2004..

[6]  Francine Berman,et al.  Heuristics for scheduling parameter sweep applications in grid environments , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[7]  Dror G. Feitelson,et al.  The workload on parallel supercomputers: modeling the characteristics of rigid jobs , 2003, J. Parallel Distributed Comput..

[8]  Lichen Zhang,et al.  Scheduling algorithm for real-time applications in grid environment , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[9]  Kavitha Ranganathan,et al.  Decoupling computation and data scheduling in distributed data-intensive applications , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[10]  Andrew A. Chien,et al.  A heuristic algorithm for mapping communicating tasks on heterogeneous resources , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[11]  P. Sadayappan,et al.  Distributed job scheduling on computational Grids using multiple simultaneous requests , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[12]  Ramin Yahyapour,et al.  Design and evaluation of job scheduling strategies for grid computing , 2000, GRID.

[13]  Yaohang Li,et al.  Improving performance via computational replication on a large-scale computational grid , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[14]  Sungyong Park,et al.  Design and Implementation of a Dynamic Communication MPI Library for the Grid , 2004 .

[15]  Ramin Yahyapour,et al.  User group-based workload analysis and modelling , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[16]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[17]  David A. Lifka,et al.  The ANL/IBM SP Scheduling System , 1995, JSSPP.

[18]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.