Optimal job packing, a backfill scheduling optimization for a cluster of workstations

Authors:
Syed Munir Hussain Shah;Kalim Qureshi;Haroon Rasheed
Affiliations:
Department of Computer Science, COMSATS Institute of Information Technology, Abbottabad, Pakistan;Department of Information Science, Kuwait University, Kuwait City, Kuwait;Department of Computer Science, COMSATS Institute of Information Technology, Abbottabad, Pakistan
Venue:
The Journal of Supercomputing
Year:
2010

Citing 15
Cited 2

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
Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization

IPPS/SPDP '99/JSSPP '99 Proceedings of the 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
Selective Reservation Strategies for Backfill Job Scheduling

JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy

JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance

JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Improving Parallel Job Scheduling by Combining Gang Scheduling and Backfilling Techniques

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Self-Adapting Backfilling Scheduling for Parallel Systems

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Backfilling with lookahead to optimize the packing of parallel jobs

Journal of Parallel and Distributed Computing
Backfilling Using System-Generated Predictions Rather than User Runtime Estimates

IEEE Transactions on Parallel and Distributed Systems
The portable batch scheduler and the maui scheduler on linux clusters

ALS'00 Proceedings of the 4th annual Linux Showcase & Conference - Volume 4
Comparing two models to generate hyper-heuristics for the 2d-regular bin-packing problem

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Alea: grid scheduling simulation environment

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
New challenges of parallel job scheduling

JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing

MIP model scheduling for multi-clusters

Euro-Par'12 Proceedings of the 18th international conference on Parallel processing workshops
Improving user QoS by relaxing resource reservation policy in high-performance grid environments

International Journal of Grid and Utility Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we have proposed two backfill scheduling optimizations, i.e., Shortest Width First Backfill (SWFBF) and Shortest Area First Backfill (SAFBF). A near optimal simple, but effective job packing algorithm called the Select-Replace algorithm has also been presented to minimize external fragmentation. Proof of the concept has been given with the help of a simulation study. Five workloads which were derived from a clean version of the parallel workload archive (CTC, LANL, and SDSC. NASA) have been used to evaluate and compare proposed heuristics with previous techniques. With the simple but effective optimizations, significant (56.1%) performance improvement has been achieved as compared to EASY scheduler.