Characterization of backfilling strategies for parallel job scheduling

Proceedings of the International Conference on Parallel Processing Workshops

Volumn 2002-January, Issue , 2002, Pages 514-519

  Srinivasan, S ^a   Kettimuthu, R ^a   Subramani, V ^a   Sadayappan, P ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TURNAROUND TIME;

EXPANSION FACTORS; FIRST-COME-FIRST-SERVED QUEUES; JOB SCHEDULING; PARALLEL JOB SCHEDULING; PARALLEL JOBS; PRIORITY POLICIES; TRACE-BASED SIMULATION; VIEWING PERFORMANCE;

SCHEDULING;

EID: 84954553318     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.2002.1039773     Document Type: Conference Paper

References (14)

1. K. Aida. Effect of job size characteristics on job scheduling performance. In Proceedings of JSSPP, pages 1-17, 2000.
2. O. Arndt, B. Freisleben, T. Kielmann, and F. Thilo. A comparative study of online scheduling algorithms for networks of workstations. Cluster Computing, 3(2):95-112, 2000.
3. D. G. Feitelson. Logs of real parallel workloads from production systems. http://www.cs.huji.ac.il/labs/parallel/workload/logs.html.
4. D. Jackson, Q. Snell, and M. J. Clement. Core algorithms of the maui scheduler. In JSSPP, pages 87-102, 2001.
5. P. J. Keleher, D. Zotkin, and D. Perkovic. Attacking the bottlenecks of backfilling schedulers. Cluster Computing, 3(4):245-254, 2000.
6. R. Kettimuthu, V. Subramani, S. Srinivasan, T. B. Gopalsamy, and P. Sadayappan. Selective preemption strategies for parallel job scheduling. To appear in Proceedings of the International Conference on Parallel Processing, 2002.
7. D. Lifka. The ANL/IBM SP scheduling system. In JSSPP, pages 295-303, 1995.
8. A. W. Mu'alem and D. G. Feitelson. Utilization, predictability, workloads, and user runtime estimates in scheduling the ibm sp2 with backfilling. In IEEE Transactions on Parallel and Distributed Computing, volume 12, pages 529-543, 2001.
9. D. Perkovic and P. J. Keleher. Randomization, speculation, and adaptation in batch schedulers. Cluster Computing, 3(4):245-254, 2000.
10. J. Skovira, W. Chan, H. Zhou, and D. Lifka. The easy - loadleveler API project. In JSSPP, pages 41-47, 1996.
11. A. Streit. On job scheduling for hpc-clusters and the dynp scheduler. In HiPC, pages 58-67, 2001.
12. V. Subramani, R. Kettimuthu, S. Srinivasan, and P. Sadayappan. Distributed job scheduling on computational grids using multiple simultaneous requests. In Proceedings of the 11th High Performance Distributed Computing Conference, 2002.
13. D. Talby and D. Feitelson. Supporting priorities and improving utilization of the ibm sp scheduler using slack-based backfilling. In In Proceedings of the 13th International Parallel Processing Symposium, 1999., 1999.
14. D. Zotkin and P. Keleher. Job-length estimation and performance in backfilling schedulers. In Proceedings of the 8th High Performance Distributed Computing Conference, 1999.