Selective preemption strategies for parallel job scheduling

Proceedings of the International Conference on Parallel Processing

Volumn 2002-January, Issue , 2002, Pages 602-610

  Kettimuthu, R ^a   Subramani, V ^a   Srinivasan, S ^a   Gopalasamy, T ^a   Panda, D K ^a   Sadayappan, P ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Concurrent computing; Information science; Laboratories; Performance evaluation; Processor scheduling; Runtime; Supercomputers

Indexed keywords

INFORMATION SCIENCE; LABORATORIES; SUPERCOMPUTERS;

CONCURRENT COMPUTING; PARALLEL JOB SCHEDULING; PERFORMANCE EVALUATION; PRE-EMPTIVE SCHEDULING; PROCESSOR SCHEDULING; RUNTIMES;

SCHEDULING;

EID: 73349094799     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2002.1040918     Document Type: Conference Paper

References (14)

1. S. H. Chiang, R. K. Mansharamani, and M. K. Vernon. Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies. In ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 33-44, 1994.
2. S. H. Chiang and M. K. Vernon. Production job scheduling for parallel shared memory systems. In Proceedings of International Parallel and Distributed Processing Symposium, 2002.
3. X. Deng, N. Gu, T. Brecht, and K. Lu. Preemptive scheduling of parallel jobs on multiprocessors. In SODA: ACM-SIAM Symposium on Discrete Algorithms, 1996.
4. D. G. Feitelson. Logs of real parallel workloads from production systems. URL: http://www.cs.huji.ac.il/labs/parallel/workload/logs.html.
5. D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wong. Theory and practice in parallel job scheduling. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 1-34. Springer Verlag, 1997. Lect. Notes Comput. Sci. vol. 1291.
6. D. Jackson, Q. Snell, and M. Clement. Core algorithms of the Maui scheduler. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 87-102. Springer Verlag, 2001. Lect. Notes Comput. Sci. vol. 2221.
7. L. T. Leutenneger and M. K. Vernon. The performance of multiprogrammed multiprocessor scheduling policies. In ACM SIGMETRICS Conference on Measurement and Modelling of Computer Systems, pages 226-236, May 1990.
8. D. Lifka. The ANL/IBM SP scheduling system. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 295-303. Springer-Verlag, 1995. Lect. Notes Comput. Sci. vol. 949.
9. 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 Systems, volume 12, pages 529-543, 2001.
10. E. W. Parsons and K. C. Sevcik. Implementing multiprocessor scheduling disciplines. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 166-192. Springer Verlag, 1997. Lect. Notes Comput. Sci. vol. 1291.
11. D. Perkovic and P. J. Keleher. Randomization, speculation, and adaptation in batch schedulers. Cluster Computing, 3(4):245-254, 2000.
12. K. C. Sevcik. Application scheduling and processor allocation in multiprogrammed parallel processing systems. Performance Evaluation, 19(2-3):107-140, 1994.
13. J. Skovira, W. Chan, H. Zhou, and D. Lifka. The EASY - LoadLeveler API project. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 41-47. Springer-Verlag, 1996. Lect. Notes Comput. Sci. vol. 1162.
14. J. Zahorjan and C. McCann. Processor scheduling in shared memory multiprocessors. In ACM SIGMETRICS Conference on Measurement and Modelling of Computer Systems, pages 214-225, May 1990.