Randomization helps to perform tasks on processors prone to failures

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

3 Scopus citations

Abstract

The problem of performing t tasks in a distributed system of p processors is studied. The tasks are assumed to be independent, similar (each takes one stepto be completed), and idempotent (can be performed many times and concurrently). The processors communicate by passing messages and each of them may fail. This problem is usually called do-all, it was introduced by Dwork, Halpern and Waarts. The distributed setting considered in this paper is as follows: The system is synchronous, the processors fail by stopping, reliable multicast is available. The occurrence of faults is modeled by an adversary who has to choose at least c · p processors prior to the start of the computation, for a fixed constant 0 < c < 1, must not fail the selected processors but may fail any of the remaining processors at any time. The main result is showing that there is a sharpdi fference between the expected performance of randomized algorithms versus the worst-case deterministic performance of algorithms solving the do-all problem in such a setting. Performance is measured in terms of work and communication of algorithms. Work is the total number of steps performed by all the processors while they are operational, including idling. Communication is the total number of point-to-point messages exchanged. Let effort be the sum of work and communication. A randomized algorithm is developed which has the expected effort O(t + p (1 + log* p − log*(p/t))), where log* is the number of iterations of the log function required to go with the value of function down to 1. For deterministic algorithms and their worst-case behavior, a lower bound Ω(t+p log t/ log log t) on work holds, and it is matched by the work performed by a simple algorithm.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 13th International Symposium, DISC 1999, Proceedings
EditorsPrasad Jayanti
PublisherSpringer Verlag
Pages284-296
Number of pages13
ISBN (Print)3540665315, 9783540665311
StatePublished - Jan 1 1999
Externally publishedYes
Event13th International Symposium on Distributed Computing, DISC 1999 - Bratislava, Slovakia
Duration: Sep 27 1999Sep 29 1999

Publication series

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

Conference

Conference13th International Symposium on Distributed Computing, DISC 1999
CountrySlovakia
CityBratislava
Period9/27/999/29/99

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B. S., & Kowalski, D. R. (1999). Randomization helps to perform tasks on processors prone to failures. In P. Jayanti (Ed.), Distributed Computing - 13th International Symposium, DISC 1999, Proceedings (pp. 284-296). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1693). Springer Verlag.