Possibility and the complexity of achieving fault-tolerant coordination

Rida Bazzi, Gil Neiger

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

6 Scopus citations

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
PublisherPubl by ACM
Pages203-214
Number of pages12
ISBN (Print)0897914953
StatePublished - Dec 1 1992
Externally publishedYes
EventProceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing - Vancouver, BC, Can
Duration: Aug 10 1992Aug 12 1992

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Other

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

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Possibility and the complexity of achieving fault-tolerant coordination'. Together they form a unique fingerprint.

  • 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). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). Publ by ACM.