A robust randomized algorithm to perform independent tasks

Bogdan S. Chlebus, Leszek Ga̧sieniec, Dariusz R. Kowalski, Alex A. Shvartsman

Research output: Contribution to journalArticle

Abstract

The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with processors communicating by message passing. Crashes are determined by a fully adaptive adversary that is restricted only by an upper bound f on the number of crashes. The complexity of algorithms is measured by work and communication, where work is defined as the number of available-processor steps, and communication as the number of point-to-point messages. We develop a randomized algorithm with W = O (t + p ṡ frac(log2 p, log log p)) expected work and O ((frac(p, p - f))3.4 W) expected communication, for an arbitrary number f < p of crashes.

Original languageEnglish (US)
Pages (from-to)651-665
Number of pages15
JournalJournal of Discrete Algorithms
Volume6
Issue number4
DOIs
StatePublished - Dec 1 2008
Externally publishedYes

Fingerprint

Robust Algorithm
Crash
Randomized Algorithms
Communication
Message passing
Message Passing
Scheduling
Distributed Systems
Upper bound
Arbitrary

Keywords

  • Crash failure
  • Distributed algorithm
  • Message passing
  • Ramanujan graphs
  • Randomization
  • Scheduling tasks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this

Chlebus, B. S., Ga̧sieniec, L., Kowalski, D. R., & Shvartsman, A. A. (2008). A robust randomized algorithm to perform independent tasks. Journal of Discrete Algorithms, 6(4), 651-665. https://doi.org/10.1016/j.jda.2008.03.001

A robust randomized algorithm to perform independent tasks. / Chlebus, Bogdan S.; Ga̧sieniec, Leszek; Kowalski, Dariusz R.; Shvartsman, Alex A.

In: Journal of Discrete Algorithms, Vol. 6, No. 4, 01.12.2008, p. 651-665.

Research output: Contribution to journalArticle

Chlebus, BS, Ga̧sieniec, L, Kowalski, DR & Shvartsman, AA 2008, 'A robust randomized algorithm to perform independent tasks', Journal of Discrete Algorithms, vol. 6, no. 4, pp. 651-665. https://doi.org/10.1016/j.jda.2008.03.001
Chlebus, Bogdan S. ; Ga̧sieniec, Leszek ; Kowalski, Dariusz R. ; Shvartsman, Alex A. / A robust randomized algorithm to perform independent tasks. In: Journal of Discrete Algorithms. 2008 ; Vol. 6, No. 4. pp. 651-665.
@article{283703fa4f284ecf89558cdd4b747bf1,
title = "A robust randomized algorithm to perform independent tasks",
abstract = "The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with processors communicating by message passing. Crashes are determined by a fully adaptive adversary that is restricted only by an upper bound f on the number of crashes. The complexity of algorithms is measured by work and communication, where work is defined as the number of available-processor steps, and communication as the number of point-to-point messages. We develop a randomized algorithm with W = O (t + p ṡ frac(log2 p, log log p)) expected work and O ((frac(p, p - f))3.4 W) expected communication, for an arbitrary number f < p of crashes.",
keywords = "Crash failure, Distributed algorithm, Message passing, Ramanujan graphs, Randomization, Scheduling tasks",
author = "Chlebus, {Bogdan S.} and Leszek Ga̧sieniec and Kowalski, {Dariusz R.} and Shvartsman, {Alex A.}",
year = "2008",
month = "12",
day = "1",
doi = "10.1016/j.jda.2008.03.001",
language = "English (US)",
volume = "6",
pages = "651--665",
journal = "Journal of Discrete Algorithms",
issn = "1570-8667",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - A robust randomized algorithm to perform independent tasks

AU - Chlebus, Bogdan S.

AU - Ga̧sieniec, Leszek

AU - Kowalski, Dariusz R.

AU - Shvartsman, Alex A.

PY - 2008/12/1

Y1 - 2008/12/1

N2 - The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with processors communicating by message passing. Crashes are determined by a fully adaptive adversary that is restricted only by an upper bound f on the number of crashes. The complexity of algorithms is measured by work and communication, where work is defined as the number of available-processor steps, and communication as the number of point-to-point messages. We develop a randomized algorithm with W = O (t + p ṡ frac(log2 p, log log p)) expected work and O ((frac(p, p - f))3.4 W) expected communication, for an arbitrary number f < p of crashes.

AB - The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with processors communicating by message passing. Crashes are determined by a fully adaptive adversary that is restricted only by an upper bound f on the number of crashes. The complexity of algorithms is measured by work and communication, where work is defined as the number of available-processor steps, and communication as the number of point-to-point messages. We develop a randomized algorithm with W = O (t + p ṡ frac(log2 p, log log p)) expected work and O ((frac(p, p - f))3.4 W) expected communication, for an arbitrary number f < p of crashes.

KW - Crash failure

KW - Distributed algorithm

KW - Message passing

KW - Ramanujan graphs

KW - Randomization

KW - Scheduling tasks

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

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

U2 - 10.1016/j.jda.2008.03.001

DO - 10.1016/j.jda.2008.03.001

M3 - Article

AN - SCOPUS:54449084777

VL - 6

SP - 651

EP - 665

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

SN - 1570-8667

IS - 4

ER -