Leader election in the presence of n-1 initial failures

DOI10.1016/0020-0190(89)90183-XzbMath0684.68023OpenAlexW1981210175MaRDI QIDQ1825627

Gadi Taubenfeld

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90183-x

zbMATH Keywords

shared memoryleader electioncrash failuresinitial failuresregular registers

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99)

Related Items (1)

Possibility and impossibility results in a shared memory environment

Cites Work

• On interprocess communication. II: Algorithms
• Possibility and impossibility results in a shared memory environment
• Impossibility of distributed consensus with one faulty process
• Unnamed Item

This page was built for publication: Leader election in the presence of n-1 initial failures