Quiescent uniform reliable broadcast as an introduction to failure detector oracles

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

Volumn 2127, Issue , 2001, Pages 98-111

  Raynal, Michel ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Asynchronous distributed systems; Failure detectors; Fair lossy channels; Fault tolerance; Oracles; Process crashes; Quiescent protocol; Uniform reliable broadcast

Indexed keywords

FAULT TOLERANCE;

ASYNCHRONOUS DISTRIBUTED SYSTEM; FAILURE DETECTORS; LOSSY CHANNEL; ORACLES; PROCESS CRASH; RELIABLE BROADCAST;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 23044531420     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44743-1_10     Document Type: Conference Paper

References (31)

1. Afek Y., Attiya H., Fekete A.D., Fischer M., Lynch N., Mansour Y., Wang D. and Zuck L., Reliable Communication over Unreliable Channels. Journal of the ACM, 41(6):1267-1297, 1994.
2. Aguilera M.K., Chen W. and Toueg S., On Quiescent Reliable Communication. SIAM Journal of Computing, 29(6):2040-2073, 2000.
3. Aguilera M.K. and Toueg S., Failure Detection and Randomization: a Hybrid Approach to Solve Consensus. SIAM Journal of Computing, 28(3):890-903, 1998.
4. Aguilera M.K., Toueg S. and Deianov B., Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast. Proc. 13th Int. Symposium on DIStributed Computing (DISC’99), Springer -Verlag LNCS #1693, pp. 21-34, 1999.
5. Attiya H. and Welch J., Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw–Hill, 451 pages, 1998
6. Basu A., Charron-Bost B. and Toueg S., Simulating Reliable Links with Unreliable Links in the Presence ofPro cess Crashes. Proc. 10th Int. Workshop on Distributed Algorithms (now, DISC), Springer -Verlag LNCS #1051, pp. 105-121, 1996
7. Ben-Or M., Another Advantage ofF ree Choice: Completely Asynchronous Agreement Protocols. Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC’83), ACM Press, pp. 27-30, Montr´eal (Canada), 1983
8. Biran O., Moran S. and Zaks S., A Combinatorial Characterization of the Distributed 1-Solvable Tasks. Journal of Algorithms, 11:420-440, 1990.
9. Chandra T. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225-267, 1996.
10. Chandra T., Hadzilacos V. and Toueg S., The Weakest Failure Detector for Solving Consensus. Journal of the ACM, 43(4):685–722, July 1996.
11. Chaudhuri S., More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation, 105:132-158, 1993.
12. Dolev D., Lynch N., Pinter S., Stark E.W., andWeihl W.E., Reaching Approximate Agreement in the Presence ofF aults. Journal of the ACM, 33(3):499-516, 1986.
13. Fekete A.D., Lynch N., Mansour Y. and Spinelli J., The Impossibility ofImplemen ting Reliable Communication in Face of Crashes. Journal of the ACM, 40(5):1087-1107, 1993.
14. Fischer M.J., Lynch N. and Paterson M.S., Impossibility ofDistributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374–382, 1985.
15. Garey M.R. and Johnson D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W.H. & Co, New York, 340 pages, 1979
16. Hadzilacos V. and Toueg S., Reliable Broadcast and Related Problems. In Distributed Systems, acm Press (S. Mullender Ed.), New-York, pp. 97-145, 1993
17. Halpern J.Y. and Ricciardi A., A Knowledge-Theoretic Analysis ofUnif orm Distributed Coordination and Failure Detectors. Proc. 18th ACM Symposium on Principles of Distributed Computing (PODC’99), pp. 73-82, Atlanta (GA), 1999
18. H´elary J.-M., Hurfin M., Mostefaoui A., Raynal M. and Tronel F., Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors. IEEE Transactions on Parallel and Distributed Systems, 11(9):897-909, 2000
19. Hopcroft J.E. and Ullman J.D. Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading (MA), 418 pages, 1979
20. Lynch N., A Hundred Impossibility Proofs for Distributed Computing. Invited Talk, Proc. 8th ACM Symposium on Principles of Distributed Computing (PODC’89), ACM Press, pp 1-27, Edmonton (Canada), 1989.
21. Lynch N., Distributed Algorithms. Morgan Kaufmann Pub., San Francisco (CA), 872 pages, 1996
22. Mostefaoui A., Rajsbaum S. and Raynal M., Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. Proc. 33rd ACM Symposium on Theory of Computing (STOC’01), ACM Press, Crete (Greece), July 2001.
23. Mostefaoui A., Rajsbaum S., Raynal M. and Roy M., A Hierarchy of Conditions for Consensus Solvability. Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC’01), ACM Press, Newport (RI), August 2001.
24. Mostefaoui A., Rajsbaum S., Raynal M. and Roy M., Condition-Based Protocols for Set Agreement Problems. Research Report #1393, IRISA, University of Rennes, France, April 2001, 21 pages. http://www.irisa.fr/bibli/publi/pi/2001/1393/1393.html
25. Mostefaoui A. and Raynal M., Solving Consensus Using Chandra-Toueg’s Unreliable Failure Detectors: a General Quorum-Based Approach. Proc. 13th Symp. On DIStributed Computing (DISC’99), Springer Verlag LNCS #1693, pp. 49-63, 1999
26. Mostefaoui A. and Raynal M., k-Set Agreement with Limited Accuracy Failure Detectors. Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC’00), Portland (OR), pp. 143-152, 2000
27. Mostefaoui A. and Raynal M., Randomized k-Set Agreement. Proc. 13th th ACM Symposium on Parallel Algorithms and Architectures (SPAA’01), ACM Press, Crete (Greece), July 2001. Research Report #1340, IRISA, University of Rennes, France, July 2000, 14 pages. http://www.irisa.fr/bibli/publi/pi/2000/1340/1340.html
28. Mostefaoui A., Raynal M. and Tronel F., The Best of Both Worlds: a Hybrid Approach to Solve Consensus. Proc. Int. Conference on Dependable Systems and Networks (DSN’00, previously FTCS), IEEE Computer Society Press, pp. 513-522, New-York City, June 2000
29. Raynal M. and Tronel F., Restricted Failure Detectors: Definition and Reduction Protocols. Information Processing Letters, 72:9197, 1999.
30. Wang D.-W. and Zuck L.D., Tight Bounds for the Sequence Transmission Problem. Proc. 8th ACM Symposium on Principles of Distributed Computing (PODC’89), ACM Press, pp. 73-83, Edmonton (Canada), 1989
31. Yang J., Neiger G. and Gafni E., Structured Derivations of Consensus Algorithms for Failure Detectors. Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC’98), Puerto Vallarta (Mexico), pp.297-308, 1998