One-step consensus with zero-degradation

Proceedings of the International Conference on Dependable Systems and Networks

Volumn 2006, Issue , 2006, Pages 137-142

  Dobre, Dan ^a   Suri, Neeraj ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS DISTRIBUTED SYSTEM MODELS; ATOMIC BROADCAST PROTOCOLS; WORKSTATIONS; ZERO-DEGRADING PROTOCOLS;

BROADCASTING; COMPUTER SYSTEM RECOVERY; MATHEMATICAL MODELS; NETWORK PROTOCOLS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33845582409     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2006.55     Document Type: Conference Paper

References (22)

1. M. K. Aguilera et al. Failure detection and consensus in the crash-recovery model. Dist. Computing, vol. 13, 2, pp. 99-125, 2000.
2. F. V. Brasileiro et al. Consensus in one communication step. Proc. of PACT, pp. 42-50, 2001.
3. L. Camargos et al. Optimal and practical WAB-based consensus algorithms. U NISI TR IC-05-07 Apr. 2005.
4. T. D. Chandra et al. The weakest failure detector for solving consensus. JACM, vol. 43, 3, pp. 685-722, 1996.
5. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. JACM, vol. 43, 2, pp. 225-267, 1996.
6. F. Chu. Reducing Ω to ◇W. Inf. Processing Letters, vol. 67, 6, pp. 289-293, 1998.
7. F. Cristian and C. Fetzer. The timed asynchronous distributed system model. Proc. FTCS, pp. 140-149, 1998.
8. C. Dwork et al. Consensus in the presence of partial synchrony. JACM, vol. 35, 2, pp. 288-323, 1988.
9. P. Dutta and R. Guerraoui. Fast indulgent consensus with zero degradation. Proc. EDCC-4, pp. 191-208, 2002.
10. M. J. Fischer et al. Impossibility of distributed consensus with one faulty process. JACM, vol. 32, 2, pp. 374-382, 1985.
11. R. Guerraoui and M. Raynal. The information structure of indulgent consensus. IEEE Trans. Computers, vol. 53, 12, pp. 453-466, 2004.
12. I. Keidar and S. Rajsbaum. On the cost of fault-tolerant consensus when there are no faults. ACM SIGACT News, Online Vol. 32, 2001.
13. L. Lamport. The part-time parliament. ACM Trans. Computer Systems, vol. 16, 2, pp. 133-169, 1998.
14. L. Lamport. Lower bounds for asynchronous consensus. Future Directions in Dist. Computing, 2004.
15. L. Lamport. Fast Paxos. MSR TR 2005-112, July 2005.
16. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
17. A. Mostéfaoui and M. Raynal. Low cost consensus-based atomic broadcast. Proc. PRDC, pp. 45-54, 2000.
18. F. Pedone and A. Schiper. Optimistic atomic broadcast: A pragmatic viewpoint. Journal of Theoretical Computer Science, vol. 291, 1, pp. 79-101, 2003.
19. F. Pedone et al. Solving agreement problems with weak ordering oracles. Proc. of EDCC, pp. 44-61, 2002.
20. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, vol. 22, 4, pp. 299-319, 1990.
21. P. Urbán et al. Neko: A single environment to simulate and prototype distributed algorithms. Proc. of Information Networking, pp. 503-511, 2001.
22. P. Dutta et al. The Overhead of Consensus Recovery. IC TR 200456, June 2004.