Managed agreement: generalizing two fundamental distributed agreement problems

DOI10.1016/J.IPL.2006.10.001MaRDI QIDQ845930zbMATH OpenOpenAlexFDO

Authors Emmanuelle Anceaume, Roy Friedman, Maria Gradinariu

Publication date 29 January 2010

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

Full work available at URL https://doi.org/10.1016/j.ipl.2006.10.001

zbMATH Keywords

formal languagesautomatic theorem proving

Mathematics Subject Classification ID

Recommendations

• Distributed agreement in dynamic peer-to-peer networks
• scientific article; zbMATH DE number 6297761
• scientific article; zbMATH DE number 2080904
• A control-theoretic perspective on the design of distributed agreement protocols
• Distributed agreement in the presence of processor and communication faults
• Convergence and asymptotic agreement in distributed decision problems
• Distributed algorithms for reaching consensus on general functions
• Multidimensional approximate agreement in Byzantine asynchronous systems
• The Time-Complexity of Local Decision in Distributed Agreement

Cites work

• Distributed Computing - IWDC 2004
• Fast non-blocking atomic commit: an inherent trade-off
• Impossibility of distributed consensus with one faulty process
• Managed agreement: generalizing two fundamental distributed agreement problems
• Non-blocking atomic commit in asynchronous distributed systems with failure detectors
• Reaching Agreement in the Presence of Faults
• SOFSEM 2004: Theory and Practice of Computer Science
• The weakest failure detector for solving consensus
• The weakest failure detectors to solve certain fundamental problems in distributed computing

Cited in

(2)

• Distributed Computing - IWDC 2004
• Managed agreement: generalizing two fundamental distributed agreement problems

This page was built for publication: Managed agreement: generalizing two fundamental distributed agreement problems

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