Introduction to reliable distributed programming

Introduction to Reliable Distributed Programming

Volumn , Issue , 2006, Pages 1-299

  Guerraoui, Rachid ^a   Rodrigues, Luís ^b  

^a EPFL   (Switzerland)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892325051     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/3-540-28846-5     Document Type: Book

References (117)

1. Abraham, I., G. V. Chockler, I. Keidar, and D. Malkhi (2004). Byzantine disk paxos: optimal resilience with byzantine shared memory. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 226-235.
2. Aguilera, M., W. Chen, and S. Toueg (2000, May). Failure detection and consensus in the crash recovery model. Distributed Computing 2(13).
3. Alpern, B. and F. Schneider (1985). Defining lineness. Technical Report TR85-650, Cornell University.
4. Amir, Y., C. Danilov, and J. Stanton (2000, June). A low latency, loss tolerant architecture and protocol for wide area group communication. In International Conference on Dependable Systems and Networks (FTCS-30, DCCA-8), New York, USA.
5. Amir, Y., D. Dolev, S. Kramer, and D. Malki (1992, July). Transis: A communication sub-system for high availability. In 22nd Annual International Symposium on Fault-Tolerant Computing (FTCS), Digest of Papers, pp. 76-84. IEEE.
6. Attiya, H., A. Bar-Noy, and D. Dolev (1995, June). Sharing memory robustly in message passing systems. Journal of the ACM 1(42).
7. Attiya, H. and J. Welch (1998). Distributed Computing. Mc Graw Hill.
8. Avoine, G., F. Gärtner, R. Guerraoui, and M. Vukolic (2005). Gracefully degrading fair exchange with security modules. In Proceedings of the European Dependable Computing Conference (EDCC), pp. 55-71.
9. Babaoglu, Ö., A. Bartoli, and G. Dini (1997). Enriched view synchrony: A programming paradigm for partitionable asynchronous distributed systems. IEEE Trans. Computers 46 (6), 642-658.
10. Baldoni, R., J.-M. Hélary, M. Raynal, and L. Tangui (2003). Consensus in byzantine asynchronous systems. J. Discrete Algorithms 1 (2), 185-210.
11. Ban, B. (1998). Jgroups: A toolkit for building fault-tolerant distributed applications in large scale.
12. Ben-Or, M. (1983). Another advantage of free choice: Completely asynchonous agreement protocols. In Proceedings of 2nd ACM Symposium on Principles of Distributed Computing (PODC'83), Montreal, Canada, pp. 27-30.
13. Bhatti, N., M. Hiltunen, R. Schlichting, and W. Chiu (1998, November). Coyote: A system for constructing fine-grain configurable communication services. ACM Trans. on Computer Systems 16(4), 321-366.
14. Birman, K. (1996). Building Secure and Reliable Network Applications. Prentice Hall.
15. Birman, K. (2005). Reliable Distributed Systems: Technologies, Web Services and Applications. Springer.
16. Birman, K., M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky (1999, May). Bimodal multicast. ACM Transactions on Computer Systems 17 (2).
17. Birman, K. and T. Joseph (1987a, February). Reliable communication in the presence of failures. ACM Transactions on Computer Systems 1(5).
18. Birman, K. and T. Joseph (1987b, February). Reliable Communication in the Presence of Failures. ACM, Transactions on Computer Systems 5(1).
19. Birman, K. and R. van Renesse (1993). Reliable Distributed Programming with the Isis Toolkit. IEEE Computer Society Press.
20. Birman, K., R. van Renesse, and W. Vogels (2001, June). Spinglass: Secure and scalable communications tools for mission-critical computing. In International Survivability Conference and Exposition, Anaheim, California, USA.
21. Boichat, R., P. Dutta, S. Frolund, and R. Guerraoui (2001, January). Deconstructing paxos. Technical Report 49, EPFL, CH 1015, Lausanne.
22. Boichat, R., P. Dutta, S. Frolund, and R. Guerraoui (2003a, March). Deconstructing paxos. In ACM SIGACT News Distributed Computing Colomn, Number 34 (1).
23. Boichat, R., P. Dutta, S. Frolund, and R. Guerraoui (2003b, June). Reconstructing paxos. In ACM SIGACT News Distributed Computing Colomn, Number 34 (2).
24. Boichat, R. and R. Guerraoui (2005). Reliable and total order broadcast in a crash-recovery model. Journal of Parallel and Distributed Computing.
25. Chandra, T., V. Hadzilacos, and S. Toueg (1996). The weakest failure detector for consensus. Journal of the ACM.
26. Chandra, T. and S. Toueg (1996). Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225-267.
27. Chang, J. and N. Maxemchuck (1984, August). Reliable broadcast protocols. ACM, Transactions on Computer Systems 2(3).
28. Cherriton, D. and W. Zwaenepoel (1985, May). Distributed process groups in the v kernel. ACM Transactions on Computer Systems 3(2).
29. Chockler, G., I. Keidar, and R. Vitenberg (2001). Group communication specifications: A comprehensive study. ACM Computing Surveys 33(4), 1-43.
30. Colouris, G., J. Dollimore, and T. Kindberg (1994). Distributed Systems, Concepts and Designs. Addison Wesley Publishing Company.
31. Cooper, E. (1984, August). Replicated procedure call. In Proceedings of the 3rd ACM symposyum on Principles of Distributed Computing, Berkeley, USA. ACM.
32. Delporte-Gallet, C., H. Fauconnier, and R. Guerraoui (2002, October). Failure detection lower bounds on consensus and registers. In Proceedings of the International Conference on Distributed Computing Systems (DISC'02).
33. Delporte-Gallet, C., H. Fauconnier, and R. Guerraoui (2005). The weakest failure detectors to implement atomic objects in message passing systems. Technical report, Ecole Polytechnique Fédérale de Lausanne (EPFL), School of Computer and Communication Systems.
34. Delporte-Gallet, C., H. Fauconnier, R. Guerraoui, V. Hadzilacos, P. Kouznetsov, and S. Toueg (2004, July). The weakest failure detectors to solve certain fundamental problems in distributed computing. In In Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 04), St.John's.
35. Doudou, A., B. Garbinato, and R. Guerraoui (2005). Tolerating arbitrary failures with state machine replication. In Dependable Computing Systems Paradigms, Performance Issues, and Applications. Wiley.
36. Dutta, D. and R. Guerraoui (2002, July). The inherent price of indulgence. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC'02).
37. Dwork, C., N. Lynch, and L. Stockmeyer (1988, April). Consensus in the presence of partial synchrony. Journal of the ACM 35(2), 288-323.
38. Eugster, P., R. Guerraoui, S. Handurukande, P. Kouznetsov, and A.-M. Kermarrec (2003). Lightweight probabilistic broadcast. ACM Trans. Comput. Syst. 21(4), 341-374.
39. Eugster, P., R. Guerraoui, and P. Kouznetsov (2004, March). Delta reliable broadcast: A probabilistic measure of broadcast reliability. In Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS 2004), Tokyo, Japan.
40. Ezhilchelvan, P., A. Mostefaoui, and M. Raynal (2001, May). Randomized multivalued consensus. In Proceedings of the Fourth International Symposium on Object-Oriented Real-Time Distributed Computing, Magdeburg, Germany.
41. Fekete, A. and N. Lesley (2003). Providing view synchrony for group communication services. Acta Informatica 40(3), 159-210.
42. Fekete, A., N. Lynch, and A. Shvartsman (2001). Specifying and using a partitionable group communication service. ACM Transactions on Computer Systems 19(2), 171-216.
43. Felber, P. and R. Guerraoui (2000). Programming with object groups in corba. IEEE Concurrency 8(1), 48-58.
44. Fidge, C. (1988). Timestamps in Message-Passing Systems that Preserve the Partial Ordering. In Proceedings of the 11th Australian Computer Science Conference.
45. Fischer, M., N. Lynch, and M. Paterson (1985, April). Impossibility of distributed consensus with one faulty process. Journal of the Association for Computing Machinery 32 (2), 374-382.
46. Friedman, R. and R. van Renesse (1995, March). Strong and weak virtual synchrony in horus. Technical Report 95-1537, Department of Computer Science, Cornell University.
47. Garbinato, B., F. Pedone, and R. Schmidt (2004). An adaptive algorithm for efficient message diffusion in unreliable environments. In Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN), pp. 507- 516.
48. Golding, R. and D. Long (1992, October). Design choices for weak-consistency group communication. Technical Report UCSC-CRL-92-45, University of California Santa Cruz.
49. Gray, C. and D. Cheriton (1989, December). Leases: An efficient fault-tolerant mechanism for distributed file cache consistency. In Proceedings of the Twelfth ACM Symposium on Operating Systems Principles, Litchfield Park, Arizona, pp. 202-210.
50. Gray, J. (1978). Notes on database operating systems. Lecture Notes in Computer Science.
51. Guerraoui, R. (2000, July). Indulgent algorithms. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC'00).
52. Guerraoui, R. (2002). Non-blocking atomic commit in asynchronous distributed systems with failure detectors. Distributed Computing 15(1), 17-25.
53. Guerraoui, R., P. Eugster, P. Felber, B. Garbinato, and K. Mazouni (2000). Experiences with object group systems. Softw., Pract. Exper. 30(12), 1375-1404.
54. Guerraoui, R. and R. Levy (2004, March). Robust emulations of a shared memory in a crash-recovery model. In Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS 2004), Tokyo, Japan.
55. Guerraoui, R., R. Oliveria, and A. Schiper (1997). Stubborn communication channels. Technical Report TR97, EPFL.
56. Guerraoui, R. and M. Raynal (2004). The information structure of indulgent consensus. IEEE Trans. Computers 53 (4), 453-466.
57. Guerraoui, R. and A. Schiper (2001). Genuine atomic multicast in asynchronous distributed systems. Theoretical Computer Science 254, 297-316.
58. Gupta, I., A.-M. Kermarrec, and A. Ganesh (2002, October). Adaptive and efficient epidemic-style protocols for reliable and scalable multicast. In Proceedings of Symposium on Reliable and Distributed Systems (SRDS 2002), Osaka, Japan.
59. Hadzilacos, V. (1984). Issues of fault tolerance in concurrent computations. Technical Report 11-84, Harvard University, Ph.D thesis.
60. Hadzilacos, V. and S. Toueg (1994, May). A modular approach to fault-tolerant broadcast and related problems. Technical Report 94-1425, Cornell University, Dept of Computer Science, Ithaca, NY.
61. Hayden, M. (1998). The Ensemble System. Ph. D. thesis, Cornell University, Computer Science Department.
62. Herlihy, M. and J. Wing (1990, July). Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 3(12).
63. Israeli, A. and M. Li (1993). Bounded timestamps. Distributed Computing 4(6), 205-209.
64. Jelasity, M., R. Guerraoui, A.-M. Kermarrec, and M. van Steen (2004, October). The peer sampling service: Experimental evaluation of unstructured gossipbased implementations. In H.-A. Jacobsen (Ed.), Middleware 2004, ACM/IFIP/ USENIX International Middleware Conference, Lecture Notes in Computer Science 3231, Toronto, Canada, pp. 79-98. Springer.
65. Kaashoek, F. and A. Tanenbaum (1991, May). Group communication in the Amoeba distributed operating system. In Proceedings of the 11th International Conference on Distributed Computing Systems, Arlington, Texas, USA, pp. 222- 230. IEEE.
66. Kaashoek, F., A. Tanenbaum, S. Hummel, and H. Bal (1989, October). An efficient reliable broadcast protocol. Operating Systems Review 4 (23).
67. Kermarrec, A.-M., L. Massoulie, and A. Ganesh (2000, October). Reliable probabilistic communication in large-scale information dissemination systems. Technical Report MMSR-TR-2000-105, Microsoft Reserach, Cambridge, UK.
68. Koldehofe, B. (2003). Buffer management in probabilistic peer-to-peer communication protocols. In Proceedings IEEE Symposium on Reliable Distributed Systems (SRDS).
69. Kouznetsov, P., R. Guerraoui, S. Handurukande, and A.-M. Kermarrec (2001, October). Reducing noise in gossip-based reliable broadcast. In Proceedings of the 20th Symposium on Reliable Distributed Systems (SRDS), NewOrleans, USA.
70. Ladin, R., B. Liskov, L. Shrira, and S. Ghemawat (1990). Lazy replication: Exploiting the semantics of distributed services. In Proceedings of the Ninth Annual ACM Symposium of Principles of Distributed Computing, pp. 43-57.
71. Lamport, L. (1977). Concurrent reading and writing. Communications of the ACM 11 (20), 806-811.
72. Lamport, L. (1978, July). Time, clocks and the ordering of events in a distributed system. Communications of the ACM 21(7), 558-565.
73. Lamport, L. (1986a). On interprocess communication, part i: Basic formalism. Distributed Computing 2(1), 75-85.
74. Lamport, L. (1986b). On interprocess communication, part ii: Algorithms. Distributed Computing 2(1), 86-101.
75. Lamport, L. (1989, May). The part-time parliament. Technical Report 49, Digital, Systems Research Center, Palo Alto, California.
76. Lamport, L., R. Shostak, and M. Pease (1982, July). The byzantine generals problem. ACM Transactions on Prog. Lang. and Systems 4(3).
77. Lin, M.-J. and K. Marzullo (1999, September). Directional gossip: Gossip in a wide area network. In Proceedings of 3rd European Dependable Computing Conference, pp. 364-379.
78. Lynch, N. (1996). Distributed Algorithms. Morgan Kaufmann.
79. Lynch, N. and A. Shvartsman (1997). Robust emulation of shared memory using dynamic quorum acknowledged broadcasts. In Proceedings of the International Symposium on Fault-Tolerant Computing Systems (FTCS'97).
80. Lynch, N. and A. Shvartsman (2002, October). Rambo: A reconfigurable atomic memory service for dynamic networks. In Proceedings of the International Conference on Distributed Computing Systems (DISC'02).
81. Malkhi, D. and M. K. Reiter (1997). Byzantine quorum systems. In Proceedings of the ACM Symposium on the Theory of Computing (STOC), pp. 569-578.
82. Martin, J.-P. and L. Alvisi (2004). A framework for dynamic byzantine storage. In Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN), pp. 325-334.
83. Miranda, H., A. Pinto, and L. Rodrigues (2001, April). Appia, a flexible protocol kernel supporting multiple coordinated channels. In Proceedings of the 21st International Conference on Distributed Computing Systems, Phoenix, Arizona, pp. 707-710. IEEE.
84. Mishra, S., L. Peterson, and R. Schlichting (1993, October). Experience with modularity in consul. Software Practice and Experience 23 (10), 1059-1075.
85. Moser, L., P. Melliar-Smith, A. Agarwal, R. Budhia, C. Lingley-Ppadopoulos, and T. Archambault (1995, June). The totem system. In Digest of Papers of the 25th International Symposium on Fault-Tolerant Computing Systems, pp. 61-66. IEEE.
86. Neiger, G. and S. Toueg (1993, April). Simulating synchronized clocks and common knowledge in distributed systems. Journal of the ACM 2(40).
87. Parrington, G., S. Shrivastava, S. Wheater, and M. Little (1995). The design and implementation of arjuna computing systems. The Journal of the USENIX Association 8(3).
88. Pereira, J., L. Rodrigues, and R. Oliveira (2003, February). Semantically reliable multicast: Definition, implementation and performance evaluation. IEEE Transactions on Computers, Special Issue on Reliable Distributed Systems 52(2), 150- 165.
89. Peterson, G. (1983). Concurrent reading while writing. ACM Transactions on Prog. Lang. and Systems 1(5), 56-65.
90. Peterson, L., N. Bucholz, and R. Schlichting (1989). Preserving and using context information in interprocess communication. ACM Transactions on Computer Systems 7(3), 217-246.
91. Postel (1981). Transmission control protocol: Internet rfc 793. Technical report, Information Sciences Institute, University of Southern California.
92. Powell, D., P. Barret, G. Bonn, M. Chereque, D. Seaton, and P. Verissimo (1994). The delta-4 distributed fault-tolerant architecture. Readings in Distributed Systems, IEEE, Casavant and Singhal (eds).
93. Raynal, M. (1986). Algorithms for Mutual Exclusion. MIT Press.
94. Raynal, M., A. Schiper, and S. Toueg (1991, September). The causal ordering abstraction and a simple way to implement it. Information processing letters 39(6), 343-350.
95. Rodrigues, L., H. Fonseca, and P. Veríssimo (1996, May). Totally ordered multicast in large-scale systems. In Proceedings of the 16th International Conference on Distributed Computing Systems, Hong Kong, pp. 503-510. IEEE.
96. Rodrigues, L., R. Guerraoui, and A. Schiper (1998). Scalable atomic multicast. In IEEE Proceedings of IC3N'98.
97. Rodrigues, L., S. Handurukande, J. Pereira, R. Guerraoui, and A.-M. Kermarrec (2003, June). Adaptive gossip-based broadcast. In Proceedings of the IEEE International Symposium on Dependable Systems and Networks.
98. Rodrigues, L. and M. Raynal (2003). Atomic broadcast in asynchronous crashrecovery distributed systems and its use in quorum-based replication. IEEE Transactions on Knowledge and Data Engineering 15(4).
99. Rodrigues, L. and P. Veríssimo (1992, October). xAMp: a Multi-primitive Group Communications Service. In Proceedings of the 11th Symposium on Reliable Distributed Systems (SRDS'11), Houston, Texas, pp. 112-121. IEEE.
100. Rufino, J., P. Veríssimo, G. Arroz, C. Almeida, and L. Rodrigues (1998, July). Fault-tolerant broadcasts in CAN. In Digest of Papers, The 28nd International Symposium on Fault-Tolerant Computing, Munich, Germany, pp. 69-73. IEEE.
101. Schneider, F. (1990). Implementing fault-tolerant services with the state machine approach. ACM Computing Surveys (22 (4)), 300-319.
102. Schneider, F., D. Gries, and R. Schlichting (1984). Fault-tolerant broadcasts. Science of Computer Programming (4), 1-15.
103. Schwarz, R. and F. Mattern (1992, February). Detecting causal relationships in distributed computations: In search of the holy grail. Technical report, Univ. Kaiserslautern, Kaiserslautern, Germany.
104. Shao, C., E. Pierce, and J. Welch (2003, October). Multi-writer consistency conditions for shared memory objects. In Proceedings of the 17th Symposium on Distributed Computing (DISC 2003), Sorrento,Italy.
105. Skeen, D. (1981, July). A decentralized termination protocol. In Proceedings of the 1st Symposium on Reliability in Distributed Software and Database Systems, Pittsburgh, USA. IEEE.
106. Tanenbaum, A. and M. van Steen (2002). Distributed Systems: Principles and Paradigms. Prentice Hall.
107. Tel, G. (1994). Introduction to Distributed Algorithms. Cambridge University Press.
108. van Renesse, R., K. Birman, and S. Maffeis (1996, April). Horus: A flexible group communication system. Communications of the ACM 4(39).
109. Veríssimo, P. and L. Rodrigues (2001). Distributed Systems for System Architects. Kluwer Academic Publishers.
110. Veríssimo, P., L. Rodrigues, and M. Baptista (1989, September). AMp: A highly parallel atomic multicast protocol. In Proceedings of the SIGCOM'89 Symposium, Austin, USA, pp. 83-93. ACM.
111. Vidyasankar, K. (1988, August). Converting lamport's regular register to atomic register. Information Processing Letters (28).
112. Vidyasankar, K. (1990, June). Concurrent reading while writing revisited. Distributed Computing 2(4).
113. Vitanyi, P. and B. Awerbuch (1986). Atomic shared register by asynchronous hardware. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS'86), pp. 233-243.
114. Voulgaris, S., M. Jelasity, and M. van Steen (2003, July). A robust and scalable peer-to-peer gossiping protocol. In G. Moro, C. Sartori, and M. Singh (Eds.), Agents and Peer-to-Peer Computing, Second International Workshop, Lecture Notes in Computer Science 2872, Melbourne, Australia. Springer.
115. Wensley, J. e. a. (1978, October). The design and analysis of a fault-tolerant computer for air craft control. IEEE 10 (66).
116. Xiao, Z., K. Birman, and R. van Renesse (2002, June). Optimizing buffer management for reliable multicast. In Proceedings of The International Conference on Dependable Systems and Networks (DSN 2002), Washington, USA.
117. Yin, J., J.-P. Martin, A. Venkataramani, L. Alvisi, andM. Dahlin (2003). Separating agreement from execution for byzantine fault tolerant services. In Proceedings of the ACM Symposium on Operating System Principles of Operating Systems (SOSP).