Solvability of Consensus: Composition Breaks Down for NonDeterministic Types

DOI10.1137/S0097539795280081zbMath0918.68030OpenAlexW2052391985MaRDI QIDQ4229406

Prasad Jayanti

Publication date: 22 February 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539795280081

zbMATH Keywords

consensuswait-free algorithmsasynchronous distributed computationnondeterministic object type

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Related Items

Wait-free computing ⋮ Relationships between broadcast and shared memory in reliable anonymous distributed systems ⋮ Hundreds of impossibility results for distributed computing