Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel

Marek Klonowski, Dariusz R. Kowalski, Jarosław Mirek, Prudence W.H. Wong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationFundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Proceedings
EditorsLeszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos
PublisherSpringer Verlag
Pages306-321
Number of pages16
ISBN (Print)9783030250263
DOIs
StatePublished - Jan 1 2019
Event22nd International Symposium on Fundamentals of Computation Theory, FCT 2019 - Copenhagen, Denmark
Duration: Aug 12 2019Aug 14 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11651 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd International Symposium on Fundamentals of Computation Theory, FCT 2019
CountryDenmark
CityCopenhagen
Period8/12/198/14/19

Fingerprint

Preemption
Fault-tolerant
Scheduling
Multiple Access Channel
Collision Detection
Communication
Arbitrary
Crash
Processing
Fault

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

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 L. A. Gąsieniec, J. Jansson, & C. Levcopoulos (Eds.), Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Proceedings (pp. 306-321). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11651 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-25027-0_21

Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel. / Klonowski, Marek; Kowalski, Dariusz R.; Mirek, Jarosław; Wong, Prudence W.H.

Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Proceedings. ed. / Leszek Antoni Gąsieniec; Jesper Jansson; Christos Levcopoulos. Springer Verlag, 2019. p. 306-321 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11651 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Klonowski, M, Kowalski, DR, Mirek, J & Wong, PWH 2019, Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel. in LA Gąsieniec, J Jansson & C Levcopoulos (eds), Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11651 LNCS, Springer Verlag, pp. 306-321, 22nd International Symposium on Fundamentals of Computation Theory, FCT 2019, Copenhagen, Denmark, 8/12/19. https://doi.org/10.1007/978-3-030-25027-0_21
Klonowski M, Kowalski DR, Mirek J, Wong PWH. Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel. In Gąsieniec LA, Jansson J, Levcopoulos C, editors, Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Proceedings. Springer Verlag. 2019. p. 306-321. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-25027-0_21
Klonowski, Marek ; Kowalski, Dariusz R. ; Mirek, Jarosław ; Wong, Prudence W.H. / Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel. Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Proceedings. editor / Leszek Antoni Gąsieniec ; Jesper Jansson ; Christos Levcopoulos. Springer Verlag, 2019. pp. 306-321 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0b54e0f3fadc404abcfd7032a5c1a217,
title = "Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel",
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.",
author = "Marek Klonowski and Kowalski, {Dariusz R.} and Jarosław Mirek and Wong, {Prudence W.H.}",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-25027-0_21",
language = "English (US)",
isbn = "9783030250263",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "306--321",
editor = "Gąsieniec, {Leszek Antoni} and Jesper Jansson and Christos Levcopoulos",
booktitle = "Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Proceedings",

}

TY - GEN

T1 - Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel

AU - Klonowski, Marek

AU - Kowalski, Dariusz R.

AU - Mirek, Jarosław

AU - Wong, Prudence W.H.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85070634958&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85070634958&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-25027-0_21

DO - 10.1007/978-3-030-25027-0_21

M3 - Conference contribution

AN - SCOPUS:85070634958

SN - 9783030250263

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 306

EP - 321

BT - Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Proceedings

A2 - Gąsieniec, Leszek Antoni

A2 - Jansson, Jesper

A2 - Levcopoulos, Christos

PB - Springer Verlag

ER -