Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes

Marek Klonowski, Dariusz R. Kowalski, Jaroslaw Mirek, Prudence W.H. Wong

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

Abstract

We study the problem of scheduling n similar jobs on m machines, with respect to the fact that jobs are dependent and some of them must be performed before others. Dependencies between jobs are modeled as a partial order relation. Machines are prone to crashes, induced by an Adaptive f-Bounded adversary who can fail up to f machines, where 0 ≤ f < m. Communication takes place via a Multiple-Access Channel (MAC), which restricts simultaneous transmissions. We show an optimal solution (with respect to total work of all machines) for partially ordered sets of jobs forming chains and an algorithm and lower bound for trees.

Original languageEnglish (US)
Title of host publication2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019
EditorsAris Gkoulalas-Divanis, Mirco Marchetti, Dimiter R. Avresky
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728125220
DOIs
StatePublished - Sep 2019
Event18th IEEE International Symposium on Network Computing and Applications, NCA 2019 - Cambridge, United States
Duration: Sep 26 2019Sep 28 2019

Publication series

Name2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019

Conference

Conference18th IEEE International Symposium on Network Computing and Applications, NCA 2019
CountryUnited States
CityCambridge
Period9/26/199/28/19

Fingerprint

Scheduling
Communication
Crash

ASJC Scopus subject areas

  • Information Systems and Management
  • Computer Networks and Communications
  • Computer Science Applications
  • Safety, Risk, Reliability and Quality

Cite this

Klonowski, M., Kowalski, D. R., Mirek, J., & Wong, P. W. H. (2019). Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes. In A. Gkoulalas-Divanis, M. Marchetti, & D. R. Avresky (Eds.), 2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019 [8935017] (2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/NCA.2019.8935017

Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes. / Klonowski, Marek; Kowalski, Dariusz R.; Mirek, Jaroslaw; Wong, Prudence W.H.

2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019. ed. / Aris Gkoulalas-Divanis; Mirco Marchetti; Dimiter R. Avresky. Institute of Electrical and Electronics Engineers Inc., 2019. 8935017 (2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019).

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

Klonowski, M, Kowalski, DR, Mirek, J & Wong, PWH 2019, Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes. in A Gkoulalas-Divanis, M Marchetti & DR Avresky (eds), 2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019., 8935017, 2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019, Institute of Electrical and Electronics Engineers Inc., 18th IEEE International Symposium on Network Computing and Applications, NCA 2019, Cambridge, United States, 9/26/19. https://doi.org/10.1109/NCA.2019.8935017
Klonowski M, Kowalski DR, Mirek J, Wong PWH. Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes. In Gkoulalas-Divanis A, Marchetti M, Avresky DR, editors, 2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019. Institute of Electrical and Electronics Engineers Inc. 2019. 8935017. (2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019). https://doi.org/10.1109/NCA.2019.8935017
Klonowski, Marek ; Kowalski, Dariusz R. ; Mirek, Jaroslaw ; Wong, Prudence W.H. / Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes. 2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019. editor / Aris Gkoulalas-Divanis ; Mirco Marchetti ; Dimiter R. Avresky. Institute of Electrical and Electronics Engineers Inc., 2019. (2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019).
@inproceedings{0b1861da35dd41439ecee26fe30c1957,
title = "Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes",
abstract = "We study the problem of scheduling n similar jobs on m machines, with respect to the fact that jobs are dependent and some of them must be performed before others. Dependencies between jobs are modeled as a partial order relation. Machines are prone to crashes, induced by an Adaptive f-Bounded adversary who can fail up to f machines, where 0 ≤ f < m. Communication takes place via a Multiple-Access Channel (MAC), which restricts simultaneous transmissions. We show an optimal solution (with respect to total work of all machines) for partially ordered sets of jobs forming chains and an algorithm and lower bound for trees.",
author = "Marek Klonowski and Kowalski, {Dariusz R.} and Jaroslaw Mirek and Wong, {Prudence W.H.}",
year = "2019",
month = "9",
doi = "10.1109/NCA.2019.8935017",
language = "English (US)",
series = "2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
editor = "Aris Gkoulalas-Divanis and Mirco Marchetti and Avresky, {Dimiter R.}",
booktitle = "2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019",

}

TY - GEN

T1 - Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes

AU - Klonowski, Marek

AU - Kowalski, Dariusz R.

AU - Mirek, Jaroslaw

AU - Wong, Prudence W.H.

PY - 2019/9

Y1 - 2019/9

N2 - We study the problem of scheduling n similar jobs on m machines, with respect to the fact that jobs are dependent and some of them must be performed before others. Dependencies between jobs are modeled as a partial order relation. Machines are prone to crashes, induced by an Adaptive f-Bounded adversary who can fail up to f machines, where 0 ≤ f < m. Communication takes place via a Multiple-Access Channel (MAC), which restricts simultaneous transmissions. We show an optimal solution (with respect to total work of all machines) for partially ordered sets of jobs forming chains and an algorithm and lower bound for trees.

AB - We study the problem of scheduling n similar jobs on m machines, with respect to the fact that jobs are dependent and some of them must be performed before others. Dependencies between jobs are modeled as a partial order relation. Machines are prone to crashes, induced by an Adaptive f-Bounded adversary who can fail up to f machines, where 0 ≤ f < m. Communication takes place via a Multiple-Access Channel (MAC), which restricts simultaneous transmissions. We show an optimal solution (with respect to total work of all machines) for partially ordered sets of jobs forming chains and an algorithm and lower bound for trees.

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

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

U2 - 10.1109/NCA.2019.8935017

DO - 10.1109/NCA.2019.8935017

M3 - Conference contribution

AN - SCOPUS:85077959025

T3 - 2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019

BT - 2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019

A2 - Gkoulalas-Divanis, Aris

A2 - Marchetti, Mirco

A2 - Avresky, Dimiter R.

PB - Institute of Electrical and Electronics Engineers Inc.

ER -