TY - GEN
T1 - Agreement problems in fault –tolerant distributed systems
AU - Charron-Bost, Bernadette
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
PY - 2001/1/1
Y1 - 2001/1/1
N2 - Reaching agreement in a distributed system is a fundamental issue of both theoretical and practical importance. Consensus, Atomic Commitment, Atomic Broadcast, Group Membership which are different versions of this paradigmunderly much of existing fault-tolerant distributed systems. We describe these problems, explain their relationships, and state some fundamental results on their solvability, depending on the system model. We then review and compare basic techniques to circumvent impossibility results in asynchronous systems: randomization, models of partial synchrony, unreliable failure detection.
AB - Reaching agreement in a distributed system is a fundamental issue of both theoretical and practical importance. Consensus, Atomic Commitment, Atomic Broadcast, Group Membership which are different versions of this paradigmunderly much of existing fault-tolerant distributed systems. We describe these problems, explain their relationships, and state some fundamental results on their solvability, depending on the system model. We then review and compare basic techniques to circumvent impossibility results in asynchronous systems: randomization, models of partial synchrony, unreliable failure detection.
UR - https://www.scopus.com/pages/publications/84943276749
U2 - 10.1007/3-540-45627-9_2
DO - 10.1007/3-540-45627-9_2
M3 - Conference contribution
AN - SCOPUS:84943276749
SN - 9783540429128
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 10
EP - 32
BT - SOFSEM 2001
A2 - Pacholski, Leszek
A2 - Ruzicka, Peter
PB - Springer Verlag
T2 - 28th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2001
Y2 - 24 November 2001 through 1 December 2001
ER -