Failure Detection Lower Bounds on Registers and Consensus
- 24 October 2002
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 237-251
- https://doi.org/10.1007/3-540-36108-1_16
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A realistic look at failure detectorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Enforcing perfect failure detectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Failure Detection Lower Bounds on Registers and ConsensusLecture Notes in Computer Science, 2002
- On the hardness of failure-sensitive agreement problemsInformation Processing Letters, 2001
- The weakest failure detector for solving consensusJournal of the ACM, 1996
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- Sharing memory robustly in message-passing systemsJournal of the ACM, 1995
- Revisiting the relationship between non-blocking atomic commitment and consensusPublished by Springer Science and Business Media LLC ,1995
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985