The Complexity of Almost-Optimal Simultaneous Coordination

Rida Bazzi, G. Neiger

Research output: Contribution to journalArticle

Abstract

The problem of fault-tolerant coordination is fundamental in distributed computing. In the past researchers have considered achieving simultaneous coordination under various failure assumptions. It has been shown that doing so optimally in synchronous systems with send/receive omission failures requires NP-hard local computation. This paper studies almost-optimal simultaneous coordination, which requires processors to coordinate within a constant additive or multiplicative number of rounds of the coordination time of an optimal protocol. It shows that achieving such coordination also requires NP-hard computation.

Original languageEnglish (US)
Pages (from-to)308-321
Number of pages14
JournalAlgorithmica (New York)
Volume17
Issue number3
StatePublished - Mar 1997

Fingerprint

Distributed computer systems
NP-complete problem
Local Computation
Synchronous Systems
Distributed Computing
Fault-tolerant
Multiplicative

Keywords

  • Common knowledge
  • Fault tolerance
  • NP-completeness
  • Processor knowledge
  • Simultaneous coordination

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Safety, Risk, Reliability and Quality
  • Applied Mathematics

Cite this

The Complexity of Almost-Optimal Simultaneous Coordination. / Bazzi, Rida; Neiger, G.

In: Algorithmica (New York), Vol. 17, No. 3, 03.1997, p. 308-321.

Research output: Contribution to journalArticle

@article{78afe4f44b984e65bc1d75d0f6541e3f,
title = "The Complexity of Almost-Optimal Simultaneous Coordination",
abstract = "The problem of fault-tolerant coordination is fundamental in distributed computing. In the past researchers have considered achieving simultaneous coordination under various failure assumptions. It has been shown that doing so optimally in synchronous systems with send/receive omission failures requires NP-hard local computation. This paper studies almost-optimal simultaneous coordination, which requires processors to coordinate within a constant additive or multiplicative number of rounds of the coordination time of an optimal protocol. It shows that achieving such coordination also requires NP-hard computation.",
keywords = "Common knowledge, Fault tolerance, NP-completeness, Processor knowledge, Simultaneous coordination",
author = "Rida Bazzi and G. Neiger",
year = "1997",
month = "3",
language = "English (US)",
volume = "17",
pages = "308--321",
journal = "Algorithmica (New York)",
issn = "0178-4617",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - The Complexity of Almost-Optimal Simultaneous Coordination

AU - Bazzi, Rida

AU - Neiger, G.

PY - 1997/3

Y1 - 1997/3

N2 - The problem of fault-tolerant coordination is fundamental in distributed computing. In the past researchers have considered achieving simultaneous coordination under various failure assumptions. It has been shown that doing so optimally in synchronous systems with send/receive omission failures requires NP-hard local computation. This paper studies almost-optimal simultaneous coordination, which requires processors to coordinate within a constant additive or multiplicative number of rounds of the coordination time of an optimal protocol. It shows that achieving such coordination also requires NP-hard computation.

AB - The problem of fault-tolerant coordination is fundamental in distributed computing. In the past researchers have considered achieving simultaneous coordination under various failure assumptions. It has been shown that doing so optimally in synchronous systems with send/receive omission failures requires NP-hard local computation. This paper studies almost-optimal simultaneous coordination, which requires processors to coordinate within a constant additive or multiplicative number of rounds of the coordination time of an optimal protocol. It shows that achieving such coordination also requires NP-hard computation.

KW - Common knowledge

KW - Fault tolerance

KW - NP-completeness

KW - Processor knowledge

KW - Simultaneous coordination

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

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

M3 - Article

AN - SCOPUS:0346506895

VL - 17

SP - 308

EP - 321

JO - Algorithmica (New York)

JF - Algorithmica (New York)

SN - 0178-4617

IS - 3

ER -