A job scheduling framework for large computing farms

Proceedings of the 2007 ACM/IEEE Conference on Supercomputing, SC'07

Volumn , Issue , 2007, Pages

  Capannini, Gabriele ^a   Baraglia, Ranieri ^a   Puppin, Diego ^a   Ricci, Laura ^b   Pasquali, Marco ^a  

^a Institute of Information Science and Technologies Pisa   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Computing farm; Deadline Scheduling; Job scheduling; Software license scheduling

Indexed keywords

COMPUTATIONAL METHODS; COMPUTERS; FARMS; HEURISTIC METHODS; REAL TIME SYSTEMS;

COMPUTING FARM; DEADLINE SCHEDULING; EARLIEST DEADLINE FIRSTS; HARDWARE AND SOFTWARES; JOB SCHEDULING; JOB SCHEDULING ALGORITHMS; MAKING DECISIONS; MODULAR ALGORITHMS; SOFTWARE LICENSE SCHEDULING; SPECIFIC PROBLEMS;

SCHEDULING;

EID: 56749177358     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1362622.1362695     Document Type: Conference Paper

References (23)

1. S. Baruah, S. Funk, and J. Goossens. Robustness results concerning edf scheduling upon uniform multiprocessors. IEEE Transactions on Computers, 52(9):1185-1195, September 2003.
2. A. Bayucan, R. L. Henderson, L. T. Jasinskyj, C. Lesiak, B. Mann, T. Proett, and D. Tweten. Portable batch system, administrator guide. Technical Report Release: 2.2, MRJ Technology Solutions, Mountain View, CA, USA, November 1999.
3. S.-H. Chiang, A. C. Arpaci-Dusseau, and M. K. Vernon. The impact of more accurate requested runtimes on production job scheduling performance. In JSSPP '02: Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing, pages 103-127, London, UK, Lect. Notes Comput. Sci. vol. 2537, 2002. Springer-Verlag.
4. A. D.Techiouba, G. Capannini, R. Baraglia, D. Puppin, M. Pasquali, and L. Ricci. Backfilling strategies for scheduling streams of jobs on computational farms. In CoreGRID Workshop on Grid Programming Model, Grid and P2P Systems Architecture, Grid Systems, Tools and Environments, Heraklion-Crete, Greece, June 2007.
5. H. El-Rewini, T. G. Lewis, and H. H. ALI. Task Scheduling in Parallel and Distributed Systems. PTR Prentice Hall, Englewood Cliffs, New Jersey, 1994.
6. Y. Etsion and D. Tsafrir. A short survey of commercial cluster batch schedulers. Technical Report 2005-13, School of Computer Science and Engineering, The Hebrew University of Jerusalem, May 2005.
7. D. D. Feitelson, L. Rudolph, and U. Schwiegelshohn. Parallel job scheduling, a status report. In Job Scheduling Strategies for Parallel Processing 10th International Workshop, pages 1-16, London, UK, Lect. Notes Comput. Sci. vol. 3277, 2004. Springer-Verlag.
8. A. Feldmann, J. Sgall, and S.-H. Teng. Dynamic scheduling on parallel machines. Theor. Comput. Sci., 130(1):49-72, 1994.
9. A. Fiat and G. J. Woeginger. Online algorithms, the state of the art. In Developments from a June 1996 seminar on Online algorithms, London, UK, Lect. Notes Comput. Sci. vol. 1442, 1998. Springer-Verlag.
10. V. Hamscher, U. Schwiegelshohn, A. Streit, and R. Yahyapour. Evaluation of job-scheduling strategies for grid computing. In GRID '00: Proceedings of the First IEEE/ACM International Workshop on Grid Computing, pages 191-202, London, UK, Lect. Notes Comput. Sci. vol. 1971, 2000. Springer-Verlag.
11. D. B. Jackson, Q. Snell, and M. J. Clement. Core algorithms of the maui scheduler. In JSSPP '01: Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing, pages 87-102, London, UK, Lect. Notes Comput. Sci. vol. 2221, 2001. Springer-Verlag.
12. T. Kawaguchi and S. Kyan. Worst case bound of an lrf schedule for the mean weighted flow-time problem. SIAM J. Comput., 15(4):1119-1129, 1986.
13. D. A. Lifka. The anl/ibm sp scheduling system. In IPPS '95: Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing, pages 295-303, London, UK, Lect. Notes Comput. Sci. vol. 949, 1995. Springer-Verlag.
14. S. Martello and P. Toth. Knapsack Problems, Algorithms and Computer Implementations. John Wiley and Sons, New York, 1990.
15. S. Microsystems. Sun one grid engine administration and user guide. Technical Report Part No. 816-2077-12, Sun Microsystems, Inc., Santa Clara, CA, USA, October 2002.
16. A. W. Muálem and D. G. Feitelson. Utilization, predictability, workloads, and user runtime estimates in scheduling the ibm sp2 with backfilling. IEEE Trans. Parallel and Distributed Syst., 12(6):529-543, June 2001.
17. D. Puppin, M. Stephenson, W. Lee, and S. Amarasinghe. Convergent scheduling. The Journal of Instruction Level Parallelism, 6(1):1-23, September 2004.
18. A. Radulescu and A. J. C. van Gemund. Low-cost task scheduling for distributed-memory machines. IEEE Trans. Parallel Distrib. Syst., 13(6):648-658, 2002.
19. U. Schwiegelshohn. Preemptive weighted completion time scheduling of parallel jobs. SIAM Journal on Computing, 33(6):1280-1308, 2004.
20. U. Schwiegelshohn, W. Ludwig, J. L. Wolf, J. Turek, and P. S. Yu. Smart smart bounds for weighted response time scheduling. SIAM J. Comput., 28(l):237-253, 1999.
21. U. Schwiegelshohn and R. Yahyapour. Analysis of first-come-first-serve parallel job scheduling. In SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, pages 629-638, Philadelphia, PA, USA, 1998. Society for Industrial and Applied Mathematics.
22. E. Shmueli and D. G. Feitelson. Backfilling with lookahead to optimize the packing of parallel jobs. J. Parallel Distrib. Comput., 65(9):1090-1107, 2005.
23. S. Srinivasan, R. Kettimuthu, V. Subramani, and P. Sadayappan. Selective reservation strategies for backfill job scheduling. In JSSPP '02: Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing, pages 55-71, London, UK, Lect. Notes Comput. Sci. vol. 2537, 2002. Springer-Verlag.