Abstract
Reliable task execution on machines that are prone to unpredictable crashes and restarts is both important and challenging, but not much work exists on the analysis of such systems. We consider the online version of the problem, with tasks arriving over time at a single machine under worst-case assumptions. We analyze the fault-tolerant properties of four popular scheduling algorithms: Longest In System (LIS), Shortest In System (SIS), Largest Processing Time (LPT) and Shortest Processing Time (SPT). We use three metrics for the evaluation and comparison of their competitive performance, namely, completed load, pending load, and latency. We also investigate the effect of resource augmentation in their performance, by increasing the speed of the machine. Hence, we compare the behavior of the algorithms for different speed intervals and show that there is no clear winner with respect to all the three considered metrics. While SPT is the only algorithm that achieves competitiveness on completed load for small speed, LIS is the only one that achieves competitiveness on latency (for large enough speed).
This research was supported in part by Ministerio de Economía y Competitividad grant TEC2014-55713-R, Regional Government of Madrid (CM) grant Cloud4BigData (S2013/ICE-2894, cofunded by FSE & FEDER), and grant FPU12/00505 from MECD.
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
Notes
- 1.
Most proofs of these results are omitted due to space limit. They will be available in the full version of this paper.
- 2.
Parameters \(\varDelta _C, \varDelta _P,\varDelta _L\) as well as \(\alpha \) may depend on system parameters like \({\pi _{min}} \), \({\pi _{max}} \) or s, which are not considered as inputs of the problem.
References
Adiri, I., Bruno, J., Frostig, E., Rinnooy Kan, A.H.G.: Single machine flow-time scheduling with a single breakdown. Acta Informatica 26(7), 679–696 (1989)
Anand, S., Garg, N., Megow, N.: Meeting deadlines: how much speed suffices? In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 232–243. Springer, Heidelberg (2011)
Andrews, M., Zhang, L.: Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data. J. ACM 52(5), 809–834 (2005)
Fernández Anta, A., Georgiou, C., Kowalski, D.R., Widmer, J., Zavou, E.: Measuring the impact of adversarial errors on packet scheduling strategies. J. Sched. 18, 1–18 (2015)
Fernández Anta, A., Georgiou, C., Kowalski, D.R., Zavou, E.: Online parallel scheduling of non-uniform tasks. Theor. Comput. Sci. 590(C), 129–146 (2015)
Bansal, N.: Algorithms for flow time scheduling. Ph.D. thesis, IBM (2003)
Boyar, J., Ellen, F.: Bounds for scheduling jobs on grid processors. In: Brodnik, A., López-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066, pp. 12–26. Springer, Heidelberg (2013)
Epstein, L., Levin, A., Marchetti-Spaccamela, A., Megow, N., Mestre, J., Skutella, M., Stougie, L.: Universal sequencing on an unreliable machine. SIAM J. Comput. 41(3), 565–586 (2012)
Epstein, L., van Stee, R.: Online bin packing with resource augmentation. Discrete Optim. 4(34), 322–333 (2007)
Georgiou, C., Kowalski, D.R.: On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts. J. Parallel Distrib. Comput. 84(C), 94–107 (2015)
Gharbi, A., Haouari, M.: Optimal parallel machines scheduling with availability constraints. Discrete Appl. Mathe. 148(1), 63–87 (2005)
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416–429 (1969)
Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299–325 (1974)
Jurdzinski, T., Kowalski, D.R., Lorys, K.: Online packet scheduling under adversarial jamming. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 193–206. Springer, Heidelberg (2015)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance [scheduling problems]. In: 1995 Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 214–221, October 1995
Kowalski, D.R., Wong, P.W.H., Zavou, E.: Fault tolerant scheduling of non-uniform tasks under resource augmentation. In: Proceedings of the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems, pp. 244–246 (2015)
Lee, C.-Y., Liman, S.D.: Single machine flow-time scheduling with scheduled maintenance. Acta Informatica 29(4), 375–382 (1992)
Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, pp. 15-1–15-14. CRC Press, Boca Raton (2004)
Sanlaville, E., Schmidt, G.: Machine scheduling with availability constraints. Acta Informatica 35(9), 795–811 (1998)
Schwan, K., Zhou, H.: Dynamic scheduling of hard real-time tasks and real-time threads. IEEE Trans. Softw. Eng. 18(8), 736–748 (1992)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)
van Stee, R.: Online scheduling and bin packing. Ph.D. thesis (2002)
Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced cpu energy. In: 1995 Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 374–382, October 1995
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Fernández Anta, A., Georgiou, C., Kowalski, D.R., Zavou, E. (2015). Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine and the Impact of Resource Augmentation. In: Pop, F., Potop-Butucaru, M. (eds) Adaptive Resource Management and Scheduling for Cloud Computing. ARMS-CC 2015. Lecture Notes in Computer Science(), vol 9438. Springer, Cham. https://doi.org/10.1007/978-3-319-28448-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-28448-4_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28447-7
Online ISBN: 978-3-319-28448-4
eBook Packages: Computer ScienceComputer Science (R0)