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
Country/TerritoryUnited States
CityCambridge
Period9/26/199/28/19

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes'. Together they form a unique fingerprint.

Cite this