Abstract
In standard backfill algorithms, a job will be terminated immediately it has been processed for its estimated runtime. This drives users not to provide tight estimates to make their jobs to be scheduled earlier but at the risk of being killed. This paper evaluated an enhanced mechanism to tolerate jobs to continue processing if they will not delay any other running or reserved jobs. By comparing the performance of this new mechanism with that of the standard easy backfill by simulation of real workloads, it is shown that both user- and system- centric performance metrics were improved. As more users underestimate the runtime of their jobs and make the estimates tighter, user-centric metrics always be improved, but the system-centric metric in some cases may degrade very slightly.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Feitelson, D.: Parallel workloads archive, http://www.cs.huji.ac.il/labs/parallel/workload
Bo, L., Dongfeng, Z., Bin, S.: Simulating Platform for Grid Computing with Reservations. Journal of System Simulation 18(suppl.2), 373–376 (2006)
Cirne, W., Berman, F.: A comprehensive model of the supercomputer workload. In: Proc. 2001 IEEE International Workshop on Workload Characterization. IEEE, Los Alamitos (2001)
Howell, F., McNab, R.: SimJava: A Discrete Event Simulation Package For Java With Applications In Computer Systems Modelling. In: Proc. Proceedings of the First International Conference on Web-based Modelling and Simulation. The Society for Modeling and Simulation International, San Diego,CA (1998)
Mu’alem, A.W., Feitelson, D.G.: Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Transactions on Parallel and Distributed Systems 12(6), 529–543 (2001)
Tsafrir, D., Etsion, Y., Feitelson, D.G.: Backfilling using system-generated predictions rather than user runtime estimates. IEEE Transactions on Parallel and Distributed Systems 18(6), 789–803 (2007)
Ward, W.A., Mahood, C.L., West, J.E.: Scheduling jobs on parallel systems using a relaxed backfill strategy. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol. 2537, pp. 88–102. Springer, Heidelberg (2002)
Wong, A.K.L., Goscinski, A.M.: The impact of under-estimated length of jobs on EASY-backfill scheduling. In: Proc. 2008 16th Euromicro Conference on Parallel, Distributed and Network-based Processing - PDP 2008, pp. 343–350. IEEE, Toulouse (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bo, L., Chen, J., Yang, M., Wang, E. (2008). Incentives to Tight the Runtime Estimates of EASY Backfilling. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds) Distributed Computing and Networking. ICDCN 2009. Lecture Notes in Computer Science, vol 5408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92295-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-92295-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92294-0
Online ISBN: 978-3-540-92295-7
eBook Packages: Computer ScienceComputer Science (R0)