Possibility and the complexity of achieving fault-tolerant coordination

Rida Bazzi, Gil Neiger

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

7 Citations (Scopus)

Abstract

The problem of fault-tolerant coordination is fundamental in distributed computing. In the past, researchers have considered two types of coordination: general coordination, in which the actions of faulty processors are irrelevant, and consistent coordination, in which the faulty processors are forbidden from acting inconsistently. This paper studies the possibility and complexity of achieving coordination in synchronous and asynchronous systems with crash, send-omission, and general omission failures. We indicate the systems in which coordination cannot be achieved and, when it can, analyze the computational complexity of optimally achieving it. In some cases, optimum solutions can be implemented in polynomial time, while in others they require NP-hard local computation. These results provide a thorough characterization of coordination and will thus aid researchers in determining the approach to take when attempting to achieve fault-tolerant coordination.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Editors Anon
Place of PublicationNew York, NY, United States
PublisherPubl by ACM
Pages203-214
Number of pages12
ISBN (Print)0897914953
StatePublished - 1992
Externally publishedYes
EventProceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing - Vancouver, BC, Can
Duration: Aug 10 1992Aug 12 1992

Other

OtherProceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing
CityVancouver, BC, Can
Period8/10/928/12/92

Fingerprint

Distributed computer systems
Computational complexity
Polynomials

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Bazzi, R., & Neiger, G. (1992). Possibility and the complexity of achieving fault-tolerant coordination. In Anon (Ed.), Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 203-214). New York, NY, United States: Publ by ACM.

Possibility and the complexity of achieving fault-tolerant coordination. / Bazzi, Rida; Neiger, Gil.

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. ed. / Anon. New York, NY, United States : Publ by ACM, 1992. p. 203-214.

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

Bazzi, R & Neiger, G 1992, Possibility and the complexity of achieving fault-tolerant coordination. in Anon (ed.), Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Publ by ACM, New York, NY, United States, pp. 203-214, Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, Vancouver, BC, Can, 8/10/92.
Bazzi R, Neiger G. Possibility and the complexity of achieving fault-tolerant coordination. In Anon, editor, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. New York, NY, United States: Publ by ACM. 1992. p. 203-214
Bazzi, Rida ; Neiger, Gil. / Possibility and the complexity of achieving fault-tolerant coordination. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. editor / Anon. New York, NY, United States : Publ by ACM, 1992. pp. 203-214
@inproceedings{cc019153dbe6421aaf4f70c3dd6c015c,
title = "Possibility and the complexity of achieving fault-tolerant coordination",
abstract = "The problem of fault-tolerant coordination is fundamental in distributed computing. In the past, researchers have considered two types of coordination: general coordination, in which the actions of faulty processors are irrelevant, and consistent coordination, in which the faulty processors are forbidden from acting inconsistently. This paper studies the possibility and complexity of achieving coordination in synchronous and asynchronous systems with crash, send-omission, and general omission failures. We indicate the systems in which coordination cannot be achieved and, when it can, analyze the computational complexity of optimally achieving it. In some cases, optimum solutions can be implemented in polynomial time, while in others they require NP-hard local computation. These results provide a thorough characterization of coordination and will thus aid researchers in determining the approach to take when attempting to achieve fault-tolerant coordination.",
author = "Rida Bazzi and Gil Neiger",
year = "1992",
language = "English (US)",
isbn = "0897914953",
pages = "203--214",
editor = "Anon",
booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Possibility and the complexity of achieving fault-tolerant coordination

AU - Bazzi, Rida

AU - Neiger, Gil

PY - 1992

Y1 - 1992

N2 - The problem of fault-tolerant coordination is fundamental in distributed computing. In the past, researchers have considered two types of coordination: general coordination, in which the actions of faulty processors are irrelevant, and consistent coordination, in which the faulty processors are forbidden from acting inconsistently. This paper studies the possibility and complexity of achieving coordination in synchronous and asynchronous systems with crash, send-omission, and general omission failures. We indicate the systems in which coordination cannot be achieved and, when it can, analyze the computational complexity of optimally achieving it. In some cases, optimum solutions can be implemented in polynomial time, while in others they require NP-hard local computation. These results provide a thorough characterization of coordination and will thus aid researchers in determining the approach to take when attempting to achieve fault-tolerant coordination.

AB - The problem of fault-tolerant coordination is fundamental in distributed computing. In the past, researchers have considered two types of coordination: general coordination, in which the actions of faulty processors are irrelevant, and consistent coordination, in which the faulty processors are forbidden from acting inconsistently. This paper studies the possibility and complexity of achieving coordination in synchronous and asynchronous systems with crash, send-omission, and general omission failures. We indicate the systems in which coordination cannot be achieved and, when it can, analyze the computational complexity of optimally achieving it. In some cases, optimum solutions can be implemented in polynomial time, while in others they require NP-hard local computation. These results provide a thorough characterization of coordination and will thus aid researchers in determining the approach to take when attempting to achieve fault-tolerant coordination.

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

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

M3 - Conference contribution

AN - SCOPUS:0026999440

SN - 0897914953

SP - 203

EP - 214

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

A2 - Anon, null

PB - Publ by ACM

CY - New York, NY, United States

ER -