Solving agreement problems with weak ordering oracles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2485, Issue , 2002, Pages 44-61

  Pedone, Fernando ^a,b   Schiper, André ^b   Urbán, Péter ^b   Cavin, David ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMS; BROADCASTING; FAULT TOLERANT COMPUTER SYSTEMS;

AGREEMENT PROBLEMS; ALL SOLUTIONS; ATOMIC BROADCAST; ATOMIC BROADCAST ALGORITHMS; CLUSTER OF WORKSTATIONS; FAULT TOLERANT DISTRIBUTED SYSTEMS; GROUP MEMBERSHIPS;

CLUSTERING ALGORITHMS;

EID: 84937551000     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36080-8_5     Document Type: Conference Paper

References (20)

1. M.K. Aguilera, W. Chen, and S. Toueg. Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks. Theoretical Computer Science, 220(1):3-30, June 1999.
2. M.K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Thrifty generic broadcast. In Proceedings of the 14th International Symposium on Distributed Computing (DISC’2000), October 2000.
3. E. Anceaume. A Lightweight Solution to Uniform Atomic Broadcast for Asynchronous Systems. In IEEE 27th Int Symp on Fault-Tolerant Computing (FTCS- 27), pages 292-301, June 1997.
4. H. Attiya and J. Welch. Distributed Computing. Mc Graw Hill, 1998.
5. M. Ben-Or. Another advantage of free choice: completely asynchronous agreement protocols. In proc. 2nd annual ACM Symposium on Principles of Distributed Computing, pages 27-30, 1983.
6. T.D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of ACM, 43(2):225-267, 1996.
7. F. Cristian and C. Fetzer. The timed asynchronous distributed system model. IEEE Transactions on Parallel & Distributed Systems, 10(6):642-657, June 1999.
8. D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchrony needed for distributed consensus. Journal of ACM, 34(1):77-97, January 1987.
9. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of ACM, 35(2):288-323, April 1988.
10. M. Fischer, N. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. Journal of ACM, 32:374-382, April 1985.
11. R. Guerraoui and A. Schiper. Consensus: the Big Misunderstanding. In IEEE Proc of the Sixth Workshop on Future Trends of Distributed Computing Systems, pages 183-188, October 1997.
12. V. Hadzilacos and S. Toueg. Fault-Tolerant Broadcasts and Related Problems. Technical Report 94-1425, Department of Computer Science, Cornell University, May 1994.
13. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
14. A. Mostefaoui and M. Raynal. Solving Consensus using Chandra-Toueg’s Unreliable Failure Detectors: A Synthetic Approach. In 13th. Intl. Symposium on Distributed Computing (DISC’99). Springer Verlag, LNCS 1693, September 1999.
15. A. Mostefaoui and M. Raynal. Leader-based consensus. Parallel Processing Letters, 11:95-107, 2001.
16. F. Pedone and A. Schiper. Generic Broadcast. In 13th. Intl. Symposium on Distributed Computing (DISC’99), pages 94-108. Springer Verlag, LNCS 1693, September 1999.
17. F. Pedone, A. Schiper, P. Urban, and D. Cavin. Solving Agreement Problems with Weak Ordering Oracles. TR IC/2002/010, EPFL, March 2002. Appears also as Technical Report HPL-2002-44, Hewlett-Packard Laboratories, March 2002.
18. M. Rabin. Randomized Byzantine Generals. In Proc. 24th Annual ACM Symposium on Foundations of Computer Science, pages 403-409, 1983.
19. A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, 10(3):149-157, April 1997.
20. Péter Urbán, Xavier Défago, and André Schiper. Neko: A single environment to simulate and prototype distributed algorithms. In Proc. of the 15th Int’l Conf. on Information Networking (ICOIN-15), Beppu City, Japan, February 2001.