Adaptive Processor Allocation for Moldable Jobs in Computational Grid

In a computational grid environment, a common practice is try to allocate an entire parallel job onto a single participating site. Sometimes a parallel job, upon its submission, cannot fit in any single site due to the occupation of some resources by running jobs. How the job scheduler handles such situations is an important issue which has the potential to further improve the utilization of grid resources as well as the performance of parallel jobs. This paper develops adaptive processor allocation policies based on the moldable property of parallel jobs to deal with such situations in a heterogeneous computational grid environment. The proposed policies are evaluated through a series of simulations using real workload traces. The results indicate that the proposed adaptive processor allocation policies can further improve the system performance of a heterogeneous computational grid significantly.

[1]  Yunhao Liu,et al.  TruGrid: a self-sustaining trustworthy grid , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

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

[3]  Philip S. Yu,et al.  Scheduling parallel tasks to minimize average response time , 1994, SODA '94.

[4]  Francine Berman,et al.  Adaptive Selection of Partition Size for Supercomputer Requests , 2000, JSSPP.

[5]  Larry Rudolph,et al.  Proceedings of the Job Scheduling Strategies for Parallel Processing , 1997 .

[6]  P. Sadayappan,et al.  Effective Selection of Partition Sizes for Moldable Scheduling of Parallel Jobs , 2002, HiPC.

[7]  Kuo-Chan Huang,et al.  An Integrated Processor Allocation and Job Scheduling Approach to Workload Management on Computing Grid , 2006, PDPTA.

[8]  Ramin Yahyapour,et al.  Benefits of global grid computing for job scheduling , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[9]  Larry Rudolph,et al.  Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing , 1995 .

[10]  Jon B. Weissman,et al.  Costs and Benefits of Load Sharing in the Computational Grid , 2004, JSSPP.

[11]  Larry Rudolph,et al.  Parallel Job Scheduling: Issues and Approaches , 1995, JSSPP.

[12]  Angela C. Sodan,et al.  Adaptive Job Scheduling Via Predictive Job Resource Allocation , 2006, JSSPP.

[13]  Uwe Schwiegelshohn,et al.  Theory and Practice in Parallel Job Scheduling , 1997, JSSPP.

[14]  Ramin Yahyapour,et al.  Economic Scheduling in Grid Computing , 2002, JSSPP.

[15]  Ramin Yahyapour,et al.  On Effects of Machine Configurations on Parallel Job Scheduling in Computational Grids , 2002 .

[16]  P. Sadayappan,et al.  Moldable Parallel Job Scheduling Using Job Efficiency: An Iterative Approach , 2006, JSSPP.

[17]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[18]  David Abramson,et al.  An Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications , 2000 .

[19]  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).

[20]  J. van Leeuwen,et al.  Job Scheduling Strategies for Parallel Processing , 2003, Lecture Notes in Computer Science.

[21]  P. Sadayappan,et al.  A Robust Scheduling Strategy for Moldable Scheduling of Parallel Jobs. , 2003 .

[22]  Achim Streit,et al.  Enhanced Algorithms for Multi-site Scheduling , 2002, GRID.

[23]  Francine Berman,et al.  Using Moldability to Improve the Performance of Supercomputer Jobs , 2002, J. Parallel Distributed Comput..