Performing tasks on restartable Message–Passing processors

Bogdan S. Chlebus, Roberto De Prisco, Alex A. Shvartsman

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

5 Scopus citations

Abstract

This work presents new algorithms for the “Do-All” problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone processors. The algorithms are based on an aggressive coordination paradigm in which multiple coordinators may be active as the result of failures. The first algorithm is tolerant of/< p stop-failures and it does not allow restarts. It has the available processor steps complexity S = 0((t+ plogp/log log p)–log f) and the message complexity M = 0(t + plogp/loglogp +/• p). Unlike prior solutions, our algorithm uses redundant broadcasts when encountering failures and, for large f, it has better S complexity. This algorithm is used as the basis for another algorithm which tolerates any pattern of stop-failures and restarts. This new algorithm is the first solution for the Do-All problem that efficiently deals with processor restarts. Its available processor steps complexity is 5 = 0((t+ p log p + f) -min{log p,log f}), and its message complexity is M = 0(t + p- logp +/-p), where/is the number of failures.

Original languageEnglish (US)
Title of host publicationDistributed Algorithms - 11th International Workshop, WDAG 1997, Proceedings
EditorsPhilippas Tsigas, Marios Mavronicolas
PublisherSpringer Verlag
Pages96-110
Number of pages15
ISBN (Print)3540635750, 9783540635758
StatePublished - Jan 1 1997
Externally publishedYes
Event11th International Workshop on Distributed Algorithms, WDAG 1997 - Saarbrucken, Germany
Duration: Sep 24 1997Sep 26 1997

Publication series

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

Conference

Conference11th International Workshop on Distributed Algorithms, WDAG 1997
CountryGermany
CitySaarbrucken
Period9/24/979/26/97

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Performing tasks on restartable Message–Passing processors'. Together they form a unique fingerprint.

  • Cite this

    Chlebus, B. S., De Prisco, R., & Shvartsman, A. A. (1997). Performing tasks on restartable Message–Passing processors. In P. Tsigas, & M. Mavronicolas (Eds.), Distributed Algorithms - 11th International Workshop, WDAG 1997, Proceedings (pp. 96-110). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1320). Springer Verlag.