Doing-it-All with bounded work and communication

Bogdan S. Chlebus, Leszek Gąsieniec, Dariusz R. Kowalski, Alexander Allister Schwarzmann

Research output: Contribution to journalArticle

Abstract

We consider the Do-All problem, where p cooperating processors need to complete t similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is measured in terms of workcomplexity and communication complexity. When work and communication are considered to be comparable resources, then the overall efficiency is meaningfully expressed in terms of effort defined as work + communication. We develop and analyze a constructive algorithm that has work O(t+plog⁡p(plog⁡p+tlog⁡t)) and a nonconstructive algorithm that has work O(t+plog2⁡p). The latter result is close to the lower bound Ω(t+plog⁡p/log⁡log⁡p) on work. The effort of each of these algorithms is proportional to its work when the number of crashes is bounded above by c p, for some positive constant c<1. We also present a nonconstructive algorithm that has effort O(t+p1.77).

Original languageEnglish (US)
Pages (from-to)1-40
Number of pages40
JournalInformation and Computation
Volume254
DOIs
StatePublished - Jun 1 2017
Externally publishedYes

Fingerprint

Communication
Crash
Communication Complexity
Message passing
Message Passing
Directly proportional
Lower bound
Resources

Keywords

  • Crash failures
  • Distributed algorithm
  • Load balancing
  • Message passing
  • Ramanujan graphs
  • Scheduling tasks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Doing-it-All with bounded work and communication. / Chlebus, Bogdan S.; Gąsieniec, Leszek; Kowalski, Dariusz R.; Schwarzmann, Alexander Allister.

In: Information and Computation, Vol. 254, 01.06.2017, p. 1-40.

Research output: Contribution to journalArticle

Chlebus, Bogdan S. ; Gąsieniec, Leszek ; Kowalski, Dariusz R. ; Schwarzmann, Alexander Allister. / Doing-it-All with bounded work and communication. In: Information and Computation. 2017 ; Vol. 254. pp. 1-40.
@article{5b7851388c384cfa9530d9fa8e7f359c,
title = "Doing-it-All with bounded work and communication",
abstract = "We consider the Do-All problem, where p cooperating processors need to complete t similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is measured in terms of workcomplexity and communication complexity. When work and communication are considered to be comparable resources, then the overall efficiency is meaningfully expressed in terms of effort defined as work + communication. We develop and analyze a constructive algorithm that has work O(t+plog⁡p(plog⁡p+tlog⁡t)) and a nonconstructive algorithm that has work O(t+plog2⁡p). The latter result is close to the lower bound Ω(t+plog⁡p/log⁡log⁡p) on work. The effort of each of these algorithms is proportional to its work when the number of crashes is bounded above by c p, for some positive constant c<1. We also present a nonconstructive algorithm that has effort O(t+p1.77).",
keywords = "Crash failures, Distributed algorithm, Load balancing, Message passing, Ramanujan graphs, Scheduling tasks",
author = "Chlebus, {Bogdan S.} and Leszek Gąsieniec and Kowalski, {Dariusz R.} and Schwarzmann, {Alexander Allister}",
year = "2017",
month = "6",
day = "1",
doi = "10.1016/j.ic.2017.02.003",
language = "English (US)",
volume = "254",
pages = "1--40",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Doing-it-All with bounded work and communication

AU - Chlebus, Bogdan S.

AU - Gąsieniec, Leszek

AU - Kowalski, Dariusz R.

AU - Schwarzmann, Alexander Allister

PY - 2017/6/1

Y1 - 2017/6/1

N2 - We consider the Do-All problem, where p cooperating processors need to complete t similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is measured in terms of workcomplexity and communication complexity. When work and communication are considered to be comparable resources, then the overall efficiency is meaningfully expressed in terms of effort defined as work + communication. We develop and analyze a constructive algorithm that has work O(t+plog⁡p(plog⁡p+tlog⁡t)) and a nonconstructive algorithm that has work O(t+plog2⁡p). The latter result is close to the lower bound Ω(t+plog⁡p/log⁡log⁡p) on work. The effort of each of these algorithms is proportional to its work when the number of crashes is bounded above by c p, for some positive constant c<1. We also present a nonconstructive algorithm that has effort O(t+p1.77).

AB - We consider the Do-All problem, where p cooperating processors need to complete t similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is measured in terms of workcomplexity and communication complexity. When work and communication are considered to be comparable resources, then the overall efficiency is meaningfully expressed in terms of effort defined as work + communication. We develop and analyze a constructive algorithm that has work O(t+plog⁡p(plog⁡p+tlog⁡t)) and a nonconstructive algorithm that has work O(t+plog2⁡p). The latter result is close to the lower bound Ω(t+plog⁡p/log⁡log⁡p) on work. The effort of each of these algorithms is proportional to its work when the number of crashes is bounded above by c p, for some positive constant c<1. We also present a nonconstructive algorithm that has effort O(t+p1.77).

KW - Crash failures

KW - Distributed algorithm

KW - Load balancing

KW - Message passing

KW - Ramanujan graphs

KW - Scheduling tasks

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

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

U2 - 10.1016/j.ic.2017.02.003

DO - 10.1016/j.ic.2017.02.003

M3 - Article

AN - SCOPUS:85018414006

VL - 254

SP - 1

EP - 40

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

ER -