Utilization and predictability in scheduling the IBM SP2 with backfilling
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1291 (10637133) , 542-546
- https://doi.org/10.1109/ipps.1998.669970
Abstract
Scheduling jobs on the IBM SP2 system is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order that the jobs arrive (FCFS scheduling) is fair and predictable, but suffers from severe fragmentation, leading to low utilization. An alternative is to use the EASY scheduler, which uses aggressive backfilling: small jobs are moved ahead to fill in holes in the schedule, provided they do not delay the first job in the queue. The authors show that a more conservative approach, in which small jobs move ahead only if they do not delay any job in the queue, produces essentially the same benefits in terms of utilization. The conservative scheme has the added advantage that queueing times can be predicted in advance, whereas in EASY the queueing time is unbounded.Keywords
This publication has 7 references indexed in Scilit:
- Improved utilization and responsiveness with gang schedulingPublished by Springer Nature ,1997
- A historical application profiler for use by parallel schedulersPublished by Springer Nature ,1997
- Theory and practice in parallel job schedulingPublished by Springer Nature ,1997
- The EASY — LoadLeveler API projectPublished by Springer Nature ,1996
- The ANL/IBM SP scheduling systemPublished by Springer Nature ,1995
- Job Scheduling in Mesh MulticomputersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessorsACM Transactions on Computer Systems, 1993