Backfilling with lookahead to optimize the performance of parallel job scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2862, Issue , 2003, Pages 228-251

  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

[No Author keywords available]

Indexed keywords

SCHEDULING;

HIGH UTILIZATIONS; PARALLEL COMPUTER; PARALLEL JOB SCHEDULING;

DYNAMIC PROGRAMMING;

EID: 0242656067     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10968987_12     Document Type: Article

References (29)

1. O. Arndt, B. Freisleben, T. Kielmann, and F. Thilo, "A Comparative Study of On-Line Scheduling Algorithms for Networks of Workstation". Cluster Computing 3(2), pp. 95-112, 2000.
2. V. Balasundaram, G. Fox, K. Kennedy, and U. Kremer, "A Static Performance Estimator to Guide Data Partitioning Decisions". In 3rd Symp. Principles and Practice of Parallel Programming, pp. 213-223, Apr 1991.
3. E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, and R. E. Tarjan, "Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms". SIAM J. Comput. 9(4), pp. 808-826, Nov 1980.
4. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, "Approximation Algorithms for Bin-Packing - An Updated Survey". In Algorithm Design for Computer Systems Design, G. Ausiello, M. Lucertini, and P. Serafini (eds.), pp. 49-106, Springer-Verlag, 1984.
5. M. V. Devarakonda and R. K. Iyer, "Predictability of Process Resource Usage: A Measurement Based Study on UNIX". IEEE Tans. Sotfw. Eng. 15(12), pp. 1579-1586, Dec 1989.
6. D. G. Feitelson, A Survey of Scheduling in Multiprogrammed Parallel Systems. Research Report RC 19790 (87657), IBM T. J. Watson Research Center, Oct 1994; revised version, Aug 1997.
7. D. G. Feitelson and L. Rudolph, "Toward Convergence in Job Schedulers for Parallel Supercomputers". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, Lect. Notes Comput. Sci. Vol. 1162, pp. 1-26, 1996.
8. D. G. Feitelson, L. Rudolph, U. Schweigelshohn, K. C. Sevcik, and P. Wong, "Theory and Practice in Parallel Job Scheduling". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, Lect. Notes Comput. Sci. Vol. 1291, pp. 1-34, 1997.
9. D. G. Feitelson and L. Rudolph, "Metrics and Benchmarking for Parallel Job scheduling". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, Lect. Notes Comput. Sci. Vol. 1459, pp. 1-24, 1998.
10. D. Jackson, Q. Snell, and M. Clement, "Core Algorithms of the Maui Scheduler". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, Lect. Notes Comput. Sci. Vol. 2221, pp. 87-102, 2001.
11. D. Karger, C. Stein, and J. Wein, "Scheduling Algorithms". In Handbook of algorithms and Theory of computation, M. J. Atallah (ed.), CRC Press, 1997.
12. S. Krakowiak, Principles of Operating Systems. The MIT Press, Cambridge Mass., 1998.
13. E. Krevat, J. G. Castanos, and J. E. Moreira, "Job Scheduling for the BlueGene/L System". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schweigelshohn (eds.), Springer-Verlag, Lect. Notes Comput. Sci. Vol. 2537, pp. 38-54, 2002.
14. P. Krueger, T-H. Lai, and V. A. Radiya, "Processor Allocation vs. Job Scheduling on Hypercube Computers". In 11th Intl. Conf. Distributed Comput. Syst., pp. 394-401, May 1991.
15. A. M. Law and W. D. Kelton, Simulation Modeling and Analysis. 3rd ed., McGraw Hill, 2000.
16. B. G. Lawson and E. Smirni, "Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schweigelshohn (eds.), Springer-Verlag, Lect. Notes Comput. Sci. Vol. 2537, pp. 72-87, 2002.
17. S. T. Leutenegger and M. K. Vernon, "The Performance of Multiprogrammed Multiprocessor Scheduling Policies". In SIGMETRICS Conf. Measurement and Modding of Comput. Syst., pp. 226-236, May 1990.
18. S. T. Leutenegger and M. K. Vernon, Multiprogrammed Multiprocessor Scheduling Issues. Research Report RC 17642 (#77699), IBM T. J. Watson Research Center, Nov 1992.
19. D. Lifka, "The ANL/IBM SP Scheduling System", In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag. Lect. Notes Comput. Sci. Vol. 949, pp. 295-303, 1995.
20. S. Majumdar, D. L. Eager, and R. B. Bunt, "Scheduling in Multiprogrammed Parallel Systems". In SIGMETRICS Conf. Measurement and Modeling of Comput. Syst., pp. 104-113, May 1988.
21. A. W. Mu'alem and D. G. Feitelson, "Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling", In IEEE Trans. on Parallel and Distributed Syst. 12(6), pp. 529-543, Jun 2001.
22. Parallel Workloads Archive. URL http://www.cs.huji.ac.il/labs/parallel/workload/.
23. V. Sarkar, "Determining Average Program Execution Times and Their Variance". In Proc. SIGPLAN Conf. Prog. Lang. Design and Implementation, pp. 298-312, Jun 1989.
24. K. C. Sevick, "Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems". Performance Evaluation 19(2-3), pp. 107-140, Mar 1994.
25. J. Sgall, "On-Line Scheduling - A Survey". In Online Algorithms: The State of the Art, A. Fiat and G. J. Woeginger, editors, Springer-Verlag, 1998. Lect. Notes Comput. Sci. Vol. 1442, pp. 196-231.
26. J. Skovira, W. Chan, H. Zhou, and D. Lifka, "The EASY - LoadLeveler API Project". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag. Lect. Notes Comput. Sci. Vol. 1162, pp. 41-47, 1996.
27. S. Srinivasan, R. Kettimuthu, V. Subramani, and P. Sadayappan, "Characterization of Backfilling Strategies for Parallel Job Scheduling". In Proc. of 2002 Intl. Workshops on Parallel Processing, Aug 2002.
28. D. Talby and D. G. Feitelson, "Supporting Priorities and Improving Utilization of the IBM SP Scheduler Using Slack-Based Backfilling". In 13th Intl. Parallel Processing Symp. (IPPS), pp. 513-517, Apr 1999.
29. W. A. Ward, Jr., C. L. Mahood, and J. E. West "Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schweigelshohn (eds.), Springer-Verlag, Lect. Notes Comput. Sci. Vol. 2537, pp. 88-102, 2002.