Abstract
We study the problem of scheduling n jobs on m identical, fault-prone machines f of which are prone to crashes by an adversary, where communication takes place via a multiple access channel without collision detection. Performance is measured by the total number of available machine steps during the whole execution (work). Our goal is to study the impact of preemption (i.e., interrupting the execution of a job and resuming it later by the same or different machine) and failures on the work performance of job processing. We identify features that determine the difficulty of the problem, and in particular, show that the complexity is asymptotically smaller when preemption is allowed.
This work is supported by the Polish National Science Center (NCN) grant UMO-2017/25/B/ST6/02553, and by Networks Sciences & Techologies (NeST), School of EEECS, University of Liverpool.
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
Similar content being viewed by others
References
Bar-Noy, A., Naor, J., Schieber, B.: Pushing dependent data in clients-providers-servers systems. Wirel. Netw. 9(5), 421–430 (2003)
Chlebus, B.S.: Randomized communication in radio networks. In: Pardalos, P.M., Rajasekaran, S., Reif, J.H., Rolim, J.D.P. (eds.) Handbook on Randomized Computing, vol. 1. Kluwer Academic Publisher (2001)
Chlebus, B.S., De Prisco, R., Shvartsman, A.A.: Performing tasks on synchronous restartable message-passing processors. Distrib. Comput. 14(1), 49–64 (2001)
Chlebus, B.S., Gasieniec, L., Kowalski, D.R., Shvartsman, A.A.: Bounding work and communication in robust cooperative computation. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 295–310. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36108-1_20
Chlebus, B.S., Kowalski, D.R.: Randomization helps to perform independent tasks reliably. Random Struct. Algorithms 24(1), 11–41 (2004)
Chlebus, B.S., Kowalski, D.R., Lingas, A.: Performing work in broadcast networks. Distrib. Comput. 18(6), 435–451 (2006)
Coffman, E.G., Garey, M.R.: Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991, pp. 241–248. ACM, New York (1991)
De Prisco, R., Mayer, A., Yung, M.: Time-optimal message-efficient work performance in the presence of faults. In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1994, pp. 161–172. ACM, New York (1994)
Dwork, C., Halpern, J.Y., Waarts, O.: Performing work efficiently in the presence of faults. SIAM J. Comput. 27(5), 1457–1491 (1998)
Galil, Z., Mayer, A., Yung, M.: Resolving message complexity of byzantine agreement and beyond. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, FOCS 1995, p. 724. IEEE Computer Society, Washington, DC (1995)
Gallager, R.G.: A perspective on multiaccess channels. IEEE Trans. Inf. Theory 31, 124–142 (1985)
Georgiou, C., Kowalski, D.R., Shvartsman, A.A.: Efficient gossip and robust distributed computation. Theor. Comput. Sci. 347(1–2), 130–166 (2005)
Georgiou, C., Shvartsman, A.A.: Cooperative Task-Oriented Computing: Algorithms and Complexity. Morgan & Claypool Publishers, San Rafael (2011)
Gondhalekar, V., Jain, R., Werth, J.: Scheduling on airdisks: efficient access to personalized information services via periodic wireless data broadcast. Technical report TR-96-25, Department of Computer Science, University of Texas, Austin, TX (1996)
Klonowski, M., Kowalski, D.R., Mirek, J.: Ordered and delayed adversaries and how to work against them on a shared channel. Distrib. Comput. (2018)
Kowalski, D.R., Shvartsman, A.A.: Performing work with asynchronous processors: message-delay-sensitive bounds. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, PODC 2003, pp. 265–274. ACM, New York (2003)
Kowalski, D.R., Wong, P.W., Zavou, E.: Fault tolerant scheduling of tasks of two sizes under resource augmentation. J. Sched. 20(6), 695–711 (2017)
Lucarelli, G., Srivastav, A., Trystram, D.: From preemptive to non-preemptive scheduling using rejections. In: Dinh, T.N., Thai, M.T. (eds.) COCOON 2016. LNCS, vol. 9797, pp. 510–519. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42634-1_41
McNaughton, R.: Scheduling with deadlines and loss functions. Manag. Sci. 6(1), 1–12 (1959)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Klonowski, M., Kowalski, D.R., Mirek, J., Wong, P.W.H. (2019). Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel. In: Gąsieniec, L., Jansson, J., Levcopoulos, C. (eds) Fundamentals of Computation Theory. FCT 2019. Lecture Notes in Computer Science(), vol 11651. Springer, Cham. https://doi.org/10.1007/978-3-030-25027-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-25027-0_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25026-3
Online ISBN: 978-3-030-25027-0
eBook Packages: Computer ScienceComputer Science (R0)