On fairness in distributed job scheduling across multiple sites

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn , Issue , 2004, Pages 35-44

  Sabin, Gerald ^a   Sahasrabudhe, Vishvesh ^a   Sadayappan, P ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER OHIO SYSTEMS; DISTRIBUTED JOB SCHEDULING; SILVER META SCHEDULER; TRACE BASED SIMULATIONS;

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; METADATA; MIDDLEWARE; PROGRAM PROCESSORS; QUEUEING THEORY; REDUNDANCY; SCHEDULING; SUPERCOMPUTERS; TURNAROUND TIME;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 20444431525     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2004.1392599     Document Type: Conference Paper

References (32)

1. http://oscinfo.osc.edu/clusterohio.
2. N. Andrade, W. Cirne, F. Brasileiro, and P. Roisenberg. Ourgrid: An approach to easily assemble grids with equitable resource sharing. In D. Feitelson, L. Rudolph, and U. Schwiegelshohn, editors, Lecture Notes in Computer Scienc, volume 2862, pages 61-86. Springer-Verlag Heidelberg, June 2003.
3. T. D. Braun, H. J. Siegel, N. Beck, L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, B. Yao, D. A. Hensgen, and R. F. Freund. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing, 61:810-837, 2001.
4. H. Casanova, G. Obertelli, F. Berman, and R. Wolski. The AppLeS Parameter Sweep Template: User-Level Middleware for the Grid. In Supercomputing, November 2000.
5. 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.
6. G. Cooperman, H. Casanova, J. Hayes, and T. Witzel. Using TOP-C and AMPIC to Port Large Parallel Applications to the Computational Grid. In CCGrid, May 2002.
7. H. Dail, H. Casanova, and F. Berman. A Decoupled Scheduling Approach for the GrADS Environment. In Proceedings of Supercomputing, November 2002.
8. X. Du and X. Zhang. Coordinating parallel processes on networks of workstations. Journal of Parallel and Distributed Computing, 46(PC971378):125-135, 1997.
9. C. Ernemann, V.Hamscher, U. Schwiegelshohn, R. Yahyapour, and A. Streit. On advantages of grid computing for parallel job scheduling.
10. D. G. Feitelson. Logs of real parallel workloads from production systems. URL: http://www.cs.huji.ac.il/labs/parallel/workload/.
11. 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.
12. I. Foster and C. Kesselman. Globus: A metacomputing infrastructure toolkit. In Intl. J. Supercomputer Applications, volume 11, pages 115-128, 1997.
13. E. Frachtenberg, D. G. Feitelson, F. Petrini, and J. Fernandez. Flexible coscheduling: Mitigating load imbalance and improving utilization of heterogeneous resources. Number 17, Apr 2003.
14. J. Frey, T. Tannenbaum, M. Livny, I. Foster, and S.Tuecke. Condor-g: A computation management agent for multiinstitutional grids. In Proc. Intl. Symp. On High Performance Distributed Computing, 2001.
15. J. Gehring and T. Preiss. Scheduling a metacomputer with uncooperative subschedulers. In In Proc. JSSPP, pages 179-201, 1999.
16. A. S. Grimshaw, W. A. Wulf, and the Legion team. The legion vision of a worldwide computer. Communications of the ACM, pages 39-45, January 1997.
17. D. Jackson. Silver meta-scheduler. URL: http://www.supercluster.org/ silver.
18. 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.
19. H. A. James, K. A. Hawick, and P. D. Coddington. Scheduling independent tasks on metacomputing systems. In Parallel and Distributed Systems, 1999.
20. 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.
21. G. Kochhar. Characterization and enhancements of backfill scheduling strategies. Master's thesis, Ohio State University, 2003.
22. G. Sabin, R. Kettimuthu, A. Rajan, and P. Sadayappan. Scheduling of parallel jobs in a heterogeneous multi-site environement: 9th international workshop, jsspp 2003 Seattle, wa, usa. In D. Feitelson, L. Rudolph, and U. Schwiegelshohn, editors, Lecture Notes in Computer Scienc, volume 2862, pages 87 - 104. Springer-Verlag Heidelberg, June 2003.
23. G. Sabin, G. Kochhar, and P. Sadayappan. Job fairness in non-preemptive job scheduling. In International Conference on Parallel Processesing, 2004.
24. U. Schwiegelshohn and R. Yahyapour. Fairness in parallel job scheduling. Journal of Scheduling, 3(5):297-320. John Wiley.,2000.
25. 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.
26. S. Smallen, H. Casanova, and F. Berman. Applying scheduling and tuning to online parallel tomography. In Supercompuling'01, November 2001.
27. S. Srinivasan. Selective reservation strategies for backfill job scheduling. Master's thesis, Ohio State University, 2002.
28. 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.
29. V. Subramani, R. Kettimuthu, S. Srinivasan, and P. Sadayappan. Distributed job scheduling on computational grids using multiple simultaneous requests. In Proceedings of the 11th High Performance Distributed Computing Conference, 2002.
30. 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.
31. S. S. Vadhiyar and J. J. Dongarra. A metascheduler for the grid. In 11-th IEEE Symposium on High Performance Distributed Computing, July 2002.
32. 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.