The complexity of synchronous iterative do-all with crashes

Chryssis Georgiou, Alexander Russell, Alex A. Shvartsman

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

Abstract

Do-All is the problem of performing N tasks in a distributed system of P failure-prone processors [8]. Many distributed and parallel algorithms have been developed for this problem and several algorithm simulations have been developed by iterating Do-All algorithms. The efficiency of the solutions for Do-All is measured in terms of work complexity where all processing steps taken by the processors are counted. We present the first non-trivial lower bounds for Do-All that capture the dependence of work on N, P and f, the number of processor crashes. For the model of computation where processors are able to make perfect load-balancing decisions locally, we also present matching upper bounds. We define the r-iterative Do-All problem that abstracts the repeated use of Do-All such as found in algorithm simulations. Our f-sensitive analysis enables us to derive a tight bound for r-iterative Do-All work (that is stronger than the r-fold work complexity of a single Do-All). Our approach that models perfect load-balancing allows for the analysis of specific algorithms to be divided into two parts: (i) the analysis of the cost of tolerating failures while performing work, and (ii) the analysis of the cost of implementing load-balancing. We demonstrate the utility and generality of this approach by improving the analysis of two known efficient algorithms. Finally we present a new upper bound on simulations of synchronous shared-memory algorithms on crash-prone processors.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 15th International Conference, DISC 2001, Proceedings
EditorsJennifer Welch
PublisherSpringer Verlag
Pages151-165
Number of pages15
ISBN (Print)3540426051, 9783540426059
DOIs
StatePublished - 2001
Externally publishedYes
Event15th International Conference on DIStributed Computing, DISC 2001 - Lisbon, Portugal
Duration: Oct 3 2001Oct 5 2001

Publication series

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

Conference

Conference15th International Conference on DIStributed Computing, DISC 2001
Country/TerritoryPortugal
CityLisbon
Period10/3/0110/5/01

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'The complexity of synchronous iterative do-all with crashes'. Together they form a unique fingerprint.

Cite this