An enhanced grid scheduling with job priority and equitable interval job distribution

Authors:
HyoYoung Lee;DongWoo Lee;R. S. Ramakrishna
Affiliations:
Department of Information and Communications, Gwangju Institute of Science and Technology, Gwangju, Republic of Korea;Department of Information and Communications, Gwangju Institute of Science and Technology, Gwangju, Republic of Korea;Department of Information and Communications, Gwangju Institute of Science and Technology, Gwangju, Republic of Korea
Venue:
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Year:
2006

Citing 17
Cited 0

Analysis of first-come-first-serve parallel job scheduling

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Randomization, speculation, and adaptation in batch schedulers

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling

IEEE Transactions on Parallel and Distributed Systems
Supporting Priorities and Improving Utilization of the IBM SP Scheduler Using Slack-Based Backfilling

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
The ANL/IBM SP Scheduling System

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Packing Schemes for Gang Scheduling

IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Theory and Practice in Parallel Job Scheduling

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
A Comparative Study of Real Workload Traces and Synthetic Workload Models for Parallel Job Scheduling

IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems

JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Preemption Based Backfill

JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Job-Length Estimation and Performance in Backfilling Schedulers

HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
Dynamic Task Assignment in Server Farms: Better Performance by Task Grouping

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Characterization of Backfilling Strategies for Parallel Job Scheduling

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
On Advantages of Grid Computing for Parallel Job Scheduling

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Metric and Workload Effects on Computer Systems Evaluation

Computer
Benefits of Global Grid Computing for Job Scheduling

GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
A least flow-time first load sharing approach for distributed server farm

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The scheduling service is an important component of large scale computing environments. In this paper, we take a local and grid-wise look at the scheduling problem. First an advance backfilling algorithm based on the job square with a wide job priority is presented. Experimental results show that the priority scheduler reduces the mean waiting time to an extent that depends on the proportion of narrow jobs within a workload. Subsequently, we consider a load sharing technique that selects the site in the Grid that is executing the least number of jobs of similar size as that of the current job. The adaptive sharing scheme offers significant benefits in terms of the average weighted waiting time.