Abstract
This paper presents a set of strategies for scheduling a stream of batch jobs on the machines of a heterogeneous computational farm. Our proposal is based on a flexible backfilling, which schedules jobs according to a priority assigned to each job submitted for execution. Priority values are computed as a result of a set of heuristics whose main goal is to improve resources utilization and to meet the job QoS requirements. The heuristics consider job deadlines, estimated execution time and aging of the jobs in the scheduling queue. Furthermore, the set of software licenses required by a job is also considered. The different proposals have been compared through simulations. Performance figures show the applicability of our approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Talby, D.G. Feitelson, “Supporting Priorities and Improving Utilization of the IBM SP using slack based backfilling”, in 13-th Parallel Processing Symposium,pp. 513-517, April 1999.
D. Tsafrir, Y. Etsion, D.G. Feitelson, “Backfilling Using System-Generated Predictions Rather than User Runtime Estimates”, IEEE Transactions on Parallel and Distributed Systems, vol.18, n. 6, pp. 789-803, June 2006.
D. Lifka, “The ANL/IBM SP scheduling system”, in 1st Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), D.G. Feitelson and L. Rudolph (eds.), pp. 295-303, Springer-Verlag, Apr 1995. Lect. Notes Comput. Sci. vol. 949.
D. Jackson, Q. Snell, and M. Clement, “Core algorithms of the Maui scheduler”, in 7th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), D.G. Feitelson and L. Rudolph (eds.), pp. 87-102, Springer-Verlag, Jun 2001. Lect. Notes Comput. Sci. vol. 2221.
A.W. Mu’alem and D.G. Feitelson, “Utilization, Predictability, Workloads and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling”, IEEE Trans. Parallel and Distributed Systems 12(6), pp. 529-543, Jun 2001.
S-H. Chiang, A. Arpaci-Dusseau, M.K. Vernon, “The impact of more accurate requested runtimes on production job scheduling performance”, in Job Scheduling Strategies for Parallel Processing, D.G. Feitelson, L. Rudolph, and U. Schwiegelshohn (eds.), pp. 103-127, Springer Verlag, LNCS, vol. 2537, 2002.
I. Foster, C. Kesselman, “The Grid: Blueprint for a new Computing Infrastructure”, (2ndedition), Morgan Kaufmann Publishers, 1999.
Y. Etsion, 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.
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, Philadelphia, PA, USA, 1998. Society for Industrial and Applied Mathematics.
D.G. Feitelson, L. Rudolph, and U. Schwiegelshohn, “Parallel job scheduling - a status report”, June 2004.
R. Henderson and D. Tweten. “Portable batch system: External reference specification”, Technical report, NASA Ames Research Center, 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Baraglia, R., Capannini, G., Pasquali, M., Puppin, D., Ricci, L., Techiouba, A.D. (2008). Backfilling Strategies for Scheduling Streams of Jobs On Computational Farms. In: Making Grids Work. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-78448-9_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-78448-9_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-78447-2
Online ISBN: 978-0-387-78448-9
eBook Packages: Computer ScienceComputer Science (R0)