The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes

DOI10.1007/11751649_8MaRDI QIDQ3603023zbMATH OpenOpenAlexFDO

Authors Seonghoon Park

Publication date 12 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751649_8

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Solving Election Problem in Asynchronous Distributed Systems
• scientific article; zbMATH DE number 1983303
• scientific article; zbMATH DE number 2009837
• scientific article; zbMATH DE number 1948959
• On the hardness of failure-sensitive agreement problems.

Cited in

(7)

• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Solving Election Problem in Asynchronous Distributed Systems
• scientific article; zbMATH DE number 4096766 (Why is no real title available?)
• scientific article; zbMATH DE number 1948959 (Why is no real title available?)
• scientific article; zbMATH DE number 1983303 (Why is no real title available?)
• scientific article; zbMATH DE number 2009837 (Why is no real title available?)

This page was built for publication: The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603023)