Backfilling with Lookahead to Optimize the Performance of Parallel Job Scheduling
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 228-251
- https://doi.org/10.1007/10968987_12
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Processor allocation vs. job scheduling on hypercube computersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Job Scheduling for the BlueGene/L SystemPublished by Springer Nature ,2002
- Core Algorithms of the Maui SchedulerPublished by Springer Nature ,2001
- A comparative study of online scheduling algorithms for networks of workstationsCluster Computing, 2000
- Metrics and benchmarking for parallel job schedulingPublished by Springer Nature ,1998
- Job Scheduling Strategies for Parallel ProcessingPublished by Springer Nature ,1997
- Toward convergence in job schedulers for parallel supercomputersPublished by Springer Nature ,1996
- A static performance estimator to guide data partitioning decisionsPublished by Association for Computing Machinery (ACM) ,1991
- Predictability of process resource usage: a measurement-based study on UNIXIEEE Transactions on Software Engineering, 1989
- Performance Bounds for Level-Oriented Two-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1980