Backfilling with lookahead to optimize the packing of parallel jobs

Journal of Parallel and Distributed Computing

Volumn 65, Issue 9, 2005, Pages 1090-1107

  Shmueli, Edi ^a,b   Feitelson, Dror G ^c  

^a UNIVERSITY OF HAIFA   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Backfilling; Optimal packing; Parallel job scheduling

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COMPUTER SOFTWARE; OPTIMIZATION; PROGRAM PROCESSORS; RESOURCE ALLOCATION; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING;

BACKFILLING; LOOKAHEAD OPTIMIZING SCHEDULER (LOS); OPTIMAL PACKING; PARALLEL JOB SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 23744462024     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2005.05.003     Document Type: Article

References (27)

1. G.A. Abandah, E.S. Davidson, Modeling the communication performance of the IBM SP2, in: D.G. Feitelson, L. Rudolph, U. Schwiegelshohn (Eds.), 10th International Parallel Processing Symposium, April 1996, pp. 249-257.
2. O. Arndt, B. Freisleben, T. Kielmann, and F. Thilo A comparative study of on-line scheduling algorithms for networks of workstation Cluster Comput. 3 2 2000 95 112
3. V. Balasundaram, G. Fox, K. Kennedy, U. Kremer, A static performance estimator to guide data partitioning decisions, in: Third Symposium Principles and Practice of Parallel Programming, April 1991, pp. 213-223.
4. S.-H. Chiang, A. Arpaci-Dusseau, M.K. Vernon, The impact of more accurate requested runtimes on production job scheduling performance, in: Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 2537, Springer, Berlin, 2002, pp. 103-127.
5. E.G. Coffman, M.R. Garey Jr., D.S. Johnson, Approximation algorithms for bin-packing - an updated survey, in: G. Ausiello, M. Lucertini, P. Serafini (Eds.), Algorithm Design for Computer Systems Design, Springer, Berlin, 1984, pp. 49-106.
6. M.V. Devarakonda, and R.K. Iyer Predictability of process resource usage: a measurement based study on UNIX IEEE Tans. Software Eng. 15 12 December 1989 1579 1586
7. D.G. Feitelson, A Survey of Scheduling in Multiprogrammed Parallel Systems, Research Report RC 19790 (87657), IBM T. J. Watson Research Center, October 1994 (revised version, August 1997).
8. D.G. Feitelson Experimental analysis of the root causes of performance evaluation results: a backfilling case study IEEE Trans. Parallel Distributed Systems 16 2 February 2005 175 182
9. M.R. Garey, and D.S. Johnson "Strong" NP-completeness results: motivation, examples, and implications J. Assoc. Comput. Mach. 25 3 July 1978 499 508
10. D. Jackson, Q. Snell, M. Clement, Core algorithms of the Maui scheduler, in: D.G. Feitelson, L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 2221, Springer, Berlin, 2001, pp 87-102.
11. J.P. Jones, B. Nitzberg, Scheduling for parallel supercomputing: a historical perspective of achievable utilization, in: D.G. Feitelson, L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 1659, Springer, Berlin, 1999, pp. 1-16.
12. D. Karger, C. Stein, and J. Wein Scheduling algorithms M.J. Atallah Handbook of Algorithms and Theory of Computation 1997 CRC Press Boca Raton, FL
13. A.M. Law, and W.D. Kelton Simulation Modeling and Analysis third ed. 2000 McGraw Hill New York
14. B.G. Lawson, E. Smirni, Multiple-queue backfilling scheduling with priorities and reservations for parallel systems, in: D.G. Feitelson, L. Rudolph, U. Schwiegelshohn (Eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 2537, Springer, Berlin, 2002, pp. 72-87.
15. D. Lifka, The ANL/IBM SP scheduling systems, in: D.G. Feitelson, L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 949. Springer, Berlin, 1995, pp. 295-303.
16. S. Majumdar, D.L. Eager, R.B. Bunt, Scheduling in multiprogrammed parallel systems, in: SIGMETRICS Conference on Measurement and Modeling of Computer Systems, May 1988, pp. 104-113.
17. A.W. Mu'alem, and D.G. Feitelson Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling IEEE Trans. Parallel Distributed Systems 12 6 June 2001 529 543
18. C.H. Papadimitriou, and K. Steiglitz Combinatorial Optimization: Algorithms and Complexity 1982 Prentice-Hall Englewood Cliffs, NJ
19. Parallel Workloads Archive, URL http://www.cs.huji.ac.il/labs/parallel/ workload.
20. V. Sarkar, Determining average program execution times and their variance, in: Proceedings of SIGPLAN Conference Programming Language Design and Implementation, June 1989, pp. 298-312.
21. K.C. Sevcik Application scheduling and processor allocation in multiprogrammed parallel processing systems Performance Evaluation 19 2-3 March 1994 107 140
22. J. Sgall, On-line scheduling - a survey, in: A. Fiat, G.J. Woeginger (Eds.), Online Algorithms: The State of the Art, Lecture Notes in Computer Science, vol. 1442, Springer, Berlin, 1998, pp. 196-231.
23. E. Shmueli, D.G. Feitelson, Backfilling with lookahead to optimize the performance of parallel job scheduling, in: D.G. Feitelson, L. Rudolph, U. Schwiegelshohn (Eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 2862, Springer, Berlin, 2003, pp. 228-251.
24. J. Skovira, W. Chan, H. Zhou, D. Lifka, The EASY - loadleveler API project, in: D.G. Feitelson, L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 1162, Springer, Berlin, 1996, pp. 41-47.
25. S. Srinivasan, R. Kettimuthu, V. Subramani, P. Sadayappan, Selective reservation strategies for backfill job scheduling, in: D.G. Feitelson, L. Rudolph, U. Schwiegelshohn (Eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 2537, Springer, Berlin, 2002, pp. 55-71.
26. D. Talby, D.G. Feitelson, Supporting priorities and improving utilization of the IBM SP scheduler using slack-based backfilling, in: 13th International Parallel Processing Symposium, April 1999, pp. 513-517.
27. W.A. Ward, C.L. Mahood Jr., J.E. West, Scheduling jobs on parallel systems using a relaxed backfill strategy, in: D.G. Feitelson, L. Rudolph, U. Schwiegelshohn (Eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 2537, Springer, Berlin, 2002, pp. 88-102.