Job fairness in non-preemptive job scheduling

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2004, Pages 186-194

  Sabin, Gerald ^a   Kochhar, Garima ^a   Sadayappan, P ^a  

^a Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; JOB ANALYSIS; QUEUEING NETWORKS; SCHEDULING; USER INTERFACES;

FIRST-COME FIRST SERVE (FCFS) POLICY; JOB SCHEDULING; SHORTEST-JOB-FIRST (SJF); SYSTEM ADMINISTRATION;

COMPUTER SCIENCE;

EID: 10044287215     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icpp.2004.1327920     Document Type: Conference Paper

References (22)

1. S.-H. Chiang, A. Arpaci-Dusseau, and M. Vernon. The impact of more accurate requested runtimes on production job scheduling performance. In Job Scheduling Strategies for Parallel Processing. Springer Verlag, 2002.
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. D. G. Feitelson. Logs of real parallel workloads from production systems. URL: http://www.cs.huji.ac.il/labs/parallel/workload/.
4. 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.
5. 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.
6. J. Jones and B. Nitzberg. Scheduling for parallel supercomputing: A historical perspective of achievable utilization. In 5th Workshop on Job Scheduling Strategies for Parallel Processing, 1999.
7. R. Kettimuthu, V. Subramani, S. Srinivasan, T. B. Gopalsamy, D. K. Panda, and P. Sadayappan. Selective preemption strategies for parallel job scheduling. In Proc. of Intl. Conf. on Parallel Processing, 2002.
8. S. D. Kleban and S. H. Clearwater. Fair share on high performance computing systems: What does fair really mean? 3rd International Symposium on Cluster Computing and the Grid, 2003.
9. G. Kochhar. Characterization and enhancements of backfill scheduling strategies. Master's thesis, Ohio State University, 2003.
10. 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.
11. 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.
12. D. Perkovic and P. J. Keleher. Randomization, speculation, and adaptation in batch schedulers. Cluster Computing, 3(4):245-254, 2000.
13. U. Schwiegelshohn and R. Yahyapour. Fairness in parallel job scheduling. Journal of Scheduling, 3(5):297-320. John Wiley., 2000.
14. 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.
15. Q. Snell, M. Clement, D. Jackson, and C. Gregory. The performance impact of advance reservation meta-scheduling. In D. G. Feitelson and L. Rudolph, editors, Workshop on Job Scheduling Strategies for Parallel Processing, volume 1911 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
16. S. Srinivasan. Selective reservation strategies for backfill job scheduling. Master's thesis, Ohio State University, 2002.
17. S. Srinivasan, R. Kettimuthu, V. Subramani, and P. Sadayappan. Characterization of backfilling strategies for job scheduling. In 2002 Intl. Workshops on Parallel Processing, August 2002. held in conjunction with the 2002 Intl. Conf. on Parallel Processing, ICPP 2002.
18. S. Srinivasan, R. Kettimuthu, V. Subramani, and P. Sadayappan. Selective reservation strategies for backfill job scheduling. In 8th Workshop on Job Scheduling Strategies for Parallel Processing, July 2002.
19. S. Srinivasan, V. Subramani, R. Kettimuthu, P. Holenarsipur, and P. Sadayappan. Effective selection of partition sizes for moldable scheduling of parallel jobs. In HiPC, pages 174-183, 2002.
20. D. Talby and D. Feitelson. Supporting priorities and improving utilization of the ibm sp scheduler using slack-based backfilling. In Proceedings of the 13th International Parallel Processing Symposium, 1999.
21. A. Wierman and M. Harchol-Balter. Classifying scheduling policies with respect to unfairness in an m/gi/1. In Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pages 238-249, 2003.
22. D. Zotkin and P. Keleher. Job-length estimation and performance in backfilling schedulers. In Proceedings of the 8th High Performance Distributed Computing Conference, 1999.