Parallel job scheduling policies to improve fairness: A case study

Proceedings of the International Conference on Parallel Processing Workshops

Volumn , Issue , 2010, Pages 346-353

  Leung, Vitus J ^a   Sabin, Gerald ^b   Sadayappan, P ^c  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b RNET Technologies Inc   (United States)

^c OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATORS; JOB SCHEDULER; MAXIMIZE THROUGHPUT; PARALLEL JOB SCHEDULING; PARALLEL MACHINE; PRIMARY FUNCTIONS; SCHEDULING STRATEGIES; SYSTEM CONSTRAINTS; USER PERFORMANCE;

SCHEDULING;

EID: 78649838284     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.2010.48     Document Type: Conference Paper

References (38)

1. CPlant. http://www.cs.sandia.gov/cplant/. Computational Plant.
2. LSF. http://www.platform.com/products/LSF/. Platform Computing.
3. OpenPBS. http://openpbs.org.
4. SLURM. http://www.llnl.gov/linux/slurm/.
5. yod. http://www.cs.sandia.gov/cplant/doc/man/load/yod.html.
6. M. Bender, D. Bunde, E. Demaine, S. Fekete, V. Leung, H. Meijer, and C. Phillips. Communication-aware processor allocation on supercomputers: Finding point sets of small average distance. Algorithmica, 50(2):279-298, 2008.
7. H. Bui, W. Emeneker, A. Apon, D. Hoffman, and L. Dowdy. Fairshare scheduling - a case study. In Proceedings of 11th LCI Conference, 2010.
8. D. Bunde, V. Leung, and J. Mache. Communication patterns and allocation strategies. In Proceedings of PMEO-PDS, 2004.
9. S. Chiang and M. Vernon. Production job scheduling for parallel shared memory systems. In Proceedings of IPDPS, 2002.
10. D. Feitelson. Logs of real parallel workloads from production systems. http://www.cs.huji.ac.il/labs/parallel/workload/.
11. D. Feitelson. Workshops on job scheduling strategies for parallel processing. www.cs.huji.ac.il/ feit/parsched/.
12. D. Feitelson, L. Rudolph, U. Schwiegelshohn, K. Sevcik, and P. Wong. Theory and practice in parallel job scheduling. In JSSPP. 1997.
13. M. Harchol-Balter, K. Sigman, and A. Wierman. Asymptotic convergence of scheduling policies with respect to slowdown. In Performance, 2002.
14. S. Hotovy. Workload evolution on the Cornell Theory Center IBM SP2. In Job Scheduling Strategies for Parallel Processing, pages 27-40, 1996. (Pubitemid 126147183)
15. M. Hovestadt, O. Kao, A. Keller, and A. Streit. Scheduling in hpc resource management systems: Queueing vs. planning. In JSSPP, 2003.
16. D. Jackson, Q. Snell, and M. Clement. Core algorithms of the Maui scheduler. In JSSPP, pages 87-102. Springer Verlag, 2001.
17. R. Jain, D.-M. Chiu, and W. Hawe. A quantitative measure of fairness and discrimination for resource allocation in shared computer system. Technical Report EC-TR-301, DEC, September 1984.
18. J. Jones and B. Nitzberg. Scheduling for parallel supercomputing: A historical perspective of achievable utilization. In JSSPP, 1999.
19. W. Jones and W. Ligon, III. Ensuring fairness among participating clusters during multi-site parallel job scheduling. In ICPADS, 2006.
20. R. Kettimuthu, V. Subramani, S. Srinivasan, T. Gopalsamy, D. Panda, and P. Sadayappan. Selective preemption strategies for parallel job scheduling. In Proc.of Intl. Conf. on Parallel Processing, 2002.
21. S. Kladiva. Department of energy does not effectively manage its supercomputers. Technical Report GAO/RCED-98-208, US GAO, 1998.
22. R. Larson. Perspectives on queues: Social justice and the psychology of queueing. Operations Research, 35(6):895-905, November 1987.
23. V. Leung, E. Arkin, M. Bender, D. Bunde, J. Johnston, A. Lal, J. Mitchell, C. Phillips, and S. Seiden. Processor allocation on CPlant: archieving general processor locality using one-dimensional allocation strategies. In Proceedings of Cluster, pages 296-304, 2002.
24. V. Leung, C. Phillips, M. Bender, and D. Bunde. Algorithmic support for commodity-based parallel computing systems. Technical Report SAND2003-3702, Sandia National Laboratories, October 2003.
25. D. Lifka. The ANL/IBM SP scheduling system. In JSSPP. 1995.
26. A. Mu'alem and D. Feitelson. Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE TPDS, 12(6):529-543, 2001.
27. D. Raz, H. Levy, and B. Avi-Itzhak. A resource-allocation queueing fairness measure. Performance Evaluation Review, 32(1):130-141, 2004.
28. G. Sabin, G. Kochhar, and P. Sadayappan. Job fairness in nonpreemptive job scheduling. In ICPP, 2004.
29. G. Sabin and P. Sadayappan. Analysis of unfairness metrics for space sharing parallel job schedulers. In JSSPP, 2005.
30. G. Sabin, V. Sahasrabudhe, and P. Sadayappan. On fairness in distributed job scheduling across multiple sites. In Proceedings of Cluster, 2004.
31. U. Schwiegelshohn and R. Yahyapour. Fairness in parallel job scheduling. Journal of Scheduling, 3(5):297-320. John Wiley., 2000.
32. J. Skovira, W. Chan, H. Zhou, and D. Lifka. The EASY - LoadLeveler API project. In JSSPP, pages 41-47. Springer-Verlag, 1996.
33. S. Srinivasan, R. Kettimuthu, V. Subramani, and P. Sadayappan. Selective reservation strategies for backfill job scheduling. In JSSPP, 2002.
34. O. Thebe, D. Bunde, and V. Leung. Scheduling restartable jobs with short test runs. In JSSPP, pages 116-137. Springer-Verlag, 2009.
35. D. Tsafrir, Y. Etsion, and D. Feitelson. Modeling user runtime estimates. In Job Scheduling Strategies for Parallel Processing, pages 1-35, 2005.
36. D. Tsafrir, Y. Etsion, and D. Feitelson. Backfilling using systemgenerated predictions rather than user runtime estimates. IEEE TPDS, 18(6):789-803, 2007.
37. S. Vasupongayya and S.-H. Chiang. On job fairness in non-preemptive parallel job scheduling. In Proceedings PDCS. IASTED, 2005.
38. P. Walker, D. Bunde, and V. Leung. Faster high-quality processor allocation. In Proceedings of 11th LCI Conference, 2010.