Production job scheduling for parallel shared memory systems

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages

  Chiang, S H ^a   Vernon, M K ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SUPERCOMPUTERS;

ALTERNATIVE PRIORITY; BACKFILL POLICIES; EQUIPARTITIONING; JOB SCHEDULING; LARGE-SCALE PARALLEL SYSTEMS; PROCESSOR ALLOCATION; SHARED MEMORY SYSTEM; WAITING-TIME;

SCHEDULING;

EID: 84981249304     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.924987     Document Type: Conference Paper

References (29)

1. K. Aida. Effect of job size characteristics on job scheduling performance. Proc. 6th Workshop on Job Scheduling Strategies for Parallel Processing, Cancun, May 2000, pp. 1-17. Lecture Notes in Comp. Sci. Vol. 1911, Springer- Verlag.
2. R. Blumofe, C. Joerg, B. Kuszmaul, C. Leiserson, K. Randall, and Y. Zhou. Cilk: An efficient multithreaded run-time system. Proc. 5th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, Santa Barbara, June 1995, pp. 207-216.
3. S.-H. Chiang, R. Mansharamani, and M. Vernon. Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies. Proc. ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Nashville, May 1994, pp. 33-44.
4. D. G. Feitelson. Packing schemes for gang scheduling. Proc. 2nd Workshop on Job Scheduling Strategies for Parallel Processing, Honolulu, Apr. 1996, pp. 89-110. Lecture Notes in Comp. Sci. Vol. 1162, Springer-Verlag.
5. D. G. Feitelson. Memory usage in the LANL CM-5 workload. Proc. 3rd Workshop on Job Scheduling Strategies for Parallel Processing, Geneva, Apr. 1997, pp. 78-94. Lecture Notes in Comp. Sci. Vol. 1291, Springer-Verlag.
6. D. G. Feitelson and B. Nitzberg. Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860. Proc. 1st Workshop on Job Scheduling Strategies for Parallel Processing, Santa Barbara, Apr. 1995, pp. 337-360. Lecture Notes in Comp. Sci. Vol. 949, Springer-Verlag.
7. D. G. Feitelson and A. M. Weil. Utilization and predictability in scheduling the IBM SP2 with backfilling. Proc. 12th Int'l. Parallel Processing Symp., Atlanta, Mar. 1998, pp. 542-546.
8. M. Frigo, C. Leiserson, and K. H. Randall. The implementation of the Cilk-5 multithreaded language. Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, Montreal, June 1998, pp. 212-223.
9. S. Hotovy. Workload evolution on the Cornell Theory Center IBM SP2. Proc. 2nd Workshop on Job Scheduling Strategies for Parallel Processing, Honolulu, Apr. 1996, pp. 27-40. Lecture Notes in Comp. Sci. Vol. 1162, Springer-Verlag.
10. Intel Corp., iPSC/860 Multi-User Accounting, Control and Scheduling Utilities Manual. Order number 312261-002, May 1992.
11. J. P. Jones and B. Nitzberg. Scheduling for parallel supercomputing: A historical perspective of achievable utilization. Proc. 5th Workshop on Job Scheduling Strategies for Parallel Processing, San Juan, Apr. 1999, pp. 1-16. Lecture Notes in Comp. Sci. Vol. 1659, Springer-Verlag.
12. W. Leinberger, G. Karypis, and V. Kumar. Job scheduling in the presence of multiple resource requirements. Proc. 1999 ACM/IEEE Supercomputing Conf., Portland, Nov. 1999.
13. S. T. Leutenneger and M. K. Vernon. The performance of multiprogrammed multiprocessor scheduling policies. Proc. ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, New York, May 1990, pp. 226-236.
14. D. Lifka. The ANL/IBM SP scheduling system. Proc. 1st Workshop on Job Scheduling Strategies for Parallel Processing, Orlando, Mar. 1995, pp. 295-303. Lecture Notes in Comp. Sci. Vol. 949, Springer-Verlag.
15. C. McCann, R. Vaswani, and J. Zahorjan. Dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Trans. on Computer Systems, 11(2):146-178, May 1993.
16. C. McCann and J. Zahorjan. Scheduling memory constrained jobs on distributed memory parallel computers. Proc. ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Ottawa, May 1995, pp. 208-219.
17. V. K. Naik, S. K. Setia, and M. S. Squillante. Performance analysis of job scheduling policies in parallel supercomputing environments. Proc. 1993 ACM/IEEE Supercomputing Conf., Portland, Nov. 1993, pp. 824-833.
18. Running Jobs on NCSA Origin2000. http://www. ncsa.uiuc.edu/SCD/Hardware/Origin2000/Doc/Jobs.html.
19. E. W. Parsons and K. C. Sevcik. Implementing multiprocessor scheduling disciplines. Proc. 3rd Workshop on Job Scheduling Strategies for Parallel Processing, Geneva, Apr. 1997, pp. 166-192.
20. D. Perkovic and P. J. Keleher. Randomization, speculation, and adaptation in batch schedulers. Proc. 2000 ACM/IEEE Supercomputing Conf., Dallas, Nov. 2000.
21. A. Scherer, H. Lu, T. Gross, and W. Zwaenepoel. Transparent adaptive parallelism on NOWs using OpenMP. Proc. 7th ACM Symp. on Principles and Practice of Parallel Programming, Atlanta, May 1999, pp. 96-106.
22. S. K. Setia, M. S. Squillante, and V. K. Naik. The impact of job memory requirements on gang-scheduling performance. Performance Evaluation Review, 26(4):30-39, Mar. 1999.
23. J. Skovira, W. Chan, H. Zhou, and K. Lifka. The EASY-Loadleveler API Project. Proc. 2nd Workshop on Job Scheduling Strategies for Parallel Processing, Honolulu, Apr. 1996, pp. 41-47. Lecture Notes in Comp. Sci. Vol. 1162, Springer-Verlag.
24. Q. Snell, M. Clement, D. Jackson, and C. Gregory. The performance impact of advance reservation metascheduling. Proc. 6th Workshop on Job Scheduling Strategies for Parallel Processing, Cancun, May 2000, pp. 137-153. Lecture Notes in Comp. Sci. Vol. 1911, Springer- Verlag.
25. D. Talby and D. G. Feitelson. Supporting priorities and improving utilization of the IBM SP2 scheduler using slack-based backfilling. Proc. 13th Int'l. Parallel Processing Symp., Atlanta, Apr. 1999, pp. 513-517.
26. A. Tucker and A. Gupta. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. Proc. 12th ACM Symp. on OS Principle, Litchfield Park, Dec. 1989, pp. 159-166.
27. K. Windisch, V. Lo, B. Nitzberg, D. Feitelson, and R. Moore. A comparison of workload traces from two production parallel machines. Proc. 6th Symp. on the Frontiers of Massively Parallel Computation, May 1996.
28. Y. Zhang, H. Franke, J. E. Moreira, and A. Sivasubramaniam. Improving parallel job scheduling by combining gang scheduling and backfilling techniques. Proc. Int'l. Parallel and Distributed Processing Symp., Cancun, May 2000, pp. 133-142.
29. D. Zotkin and P. Keleher. Job-length estimation and performance in backfilling schedulers. 8th IEEE Int'l Symp. on High Performance Distributed Computing, Redondo Beach, Aug. 1999, pp. 236-243.