Two abstractions for implementing atomic objects in dynamic systems

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

Volumn 3974 LNCS, Issue , 2006, Pages 73-87

  Friedman, Roy ^a   Raynal, Michel ^b   Travers, Corentin ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Atomic object; Communication primitive; Crash failures; Distributed system; Dynamic system; Quorum; Server; Shared memory

Indexed keywords

ATOMIC OBJECTS; COMMUNICATION PRIMITIVES; CRASH FAILURES; DISTRIBUTED SYSTEMS; QUORUM; SHARED MEMORIES;

ATOMS; CONNECTORS (STRUCTURAL); DYNAMICAL SYSTEMS; SERVERS;

ABSTRACTING;

EID: 84870791587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11795490_8     Document Type: Conference Paper

References (34)

1. Aguilera M.K., A Pleasant Stroll Through the Land of Infinitely Many Creatures. ACM SIGACTNews, Distributed Computing Column, 35(2):36-59, 2004.
2. Aguilera M.K. and Gafni E., On Using Network Attached Disks as Shared Memory. Proc. 21th ACM PODC, ACM Press, pp. 315-324, 2003.
3. Alvisi L., Malkhi D., Pierce E., Reiter M and Wright R.N., Dynamic Byzantine Quorum Systems, Proc. IEEE Conf. on Depend. Syst. and Networks (DSN'00), pp. 283-392, 2000.
4. Anceaume E., Friedman R., Gradinariu M. and Roy M., An Architecture for Dynamic Scalable Self-managed Transactions. Proc. 6th International Symposium on Distributed Objects and Applications, LNCS # 3291, pp. 1445-1462, 2004.
5. Attiya H., Bar-Noy A. and Dolev D., Sharing Memory Robustly in Message Passing Systems. Journal of the ACM, 42(1): 121-132, 1995.
6. Chandra T.D. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225-267, 1996. (Pubitemid 126628035)
7. Delporte-Gallet C., Fauconnier H. and Guerraoui R., Shared memory vs Message Passing. Tech Report IC/2003/77, EPFL, Lausanne, December 2003.
8. Delporte-Gallet C., Fauconnier H. and Guerraoui R., Hadzilacos V., Kouznetsov P. and Toueg S., The Weakest Failure Detectors to Solve Certain Fundamental Problems in Distributed Computing. Proc. 23rd ACM PODC, pp. 338-346, 2004.
9. Ezhilchelvan P., Helary J.-M. and Raynal M., Building TMR-Based Reliable Servers Despite Bounded Input Lifetime. Proc. 7th European Parallel Computing Conference (Europar'01), Manchester (UK), LNCS # 2150, pp. 482-485, 2001.
10. Friedman R., Using Virtual Synchrony to Develop Efficient Fault Tolerant Distributed Shared Memories. Technical Report 95-1506, Dept. of Computer Science, Cornell University, 1995.
11. Friedman R., Mostefaoui A. and Raynal M., Asynchronous Bounded Lifetime Failure Detectors. Information Processing Letters, 94:85-91, 2005. (Pubitemid 40308676)
12. Friedman R. and Raynal M., On the Benefits of the Functional Modular Approach in Distributed Data Management Systems. Proc. SRDS'04 IEEE satellite Workshop on Dependable Distributed Data Management (WDDDM'04), IEEE Computer Press, pp. 1-6, 2004.
13. Friedman R., Raynal M. and Travers C., Two Abstractions for Implementing Atomic Objects in Dynamic Systems. Tech Report #1692, IRISA, University of Rennes 1 (France), 2005.
14. Garcia-Molina H. and Barbara D., How to Assign Votes in a Distributed System. Journal of the ACM, 32(4):841-860, 1985. (Pubitemid 15580702)
15. Gifford D.K., Weighted Voting for Replicated Data. Proc. 7th ACM Symposium on Operating Systems Principles (SOSP'79), ACM Press, pp. 150-162, 1979.
16. Guerraoui R. and Raynal M., Fault-Tolerance Techniques for Concurrent Objects. Tech Report # 1667, 22 pages, IRISA, Université de Rennes 1 (France), December 2004.
17. Hadzilacos V. and Toueg S., Reliable Broadcast and Related Problems. In Distributed Systems, ACM Press (S. Muhender Ed.), New-York, pp. 97-145, 1993.
18. Helary J.-M., Mostefaoui A. and Raynal M., Interval Consistency of Asynchronous Distributed Computations. Journal of Computer and System Sciences, 64(2):329-349, 2002. (Pubitemid 34599453)
19. Herlihy M.P., Dynamic Quorum Adjustment for Partitioned Data. ACM Transactions on Database Systems, 12(2): 170-194, 1987.
20. Herlihy M.P., Wait-Free Synchronization. ACM TOPLAS, 13(1): 124-149, 1991.
21. Herlihy M.P. and Wing J.L., Linearizability: a Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, 1990.
22. Lamport, L., Time, Clocks and the Ordering of Events in a Distributed System. Communications of the ACM, 21(7):558-565, 1978. (Pubitemid 8615486)
23. Lamport L., On Interprocess communication. Part I: Formalism. Part II: Algorithms. Distributed Computing, 1-2(2):87-103, 1986.
24. Lynch N.A. and Shvartsman A.A., RAMBO: a Reconfigurable Atomic Memory Service for Dynamic Networks. Proc. 16th Int'l Symposium on Distributed Computing (DISC'02), Springer-Verlag LNCS #2508, pp. 173-190, 2002.
25. Malkhi D. and Reiter M., Byzantine Quorums Systems, Dist. Comp., 11(4):203-213, 1998.
26. Martin J.-P. and Alvisi L., A Framework for Dynamic Byzantine Storage, Proc. IEEE Conf. on Dependable Systems and Networks (DSN'04), pp. 325-334, 2004.
27. Merritt M. and Taubenfeld G., Computing Using Infinitely Many Processes. Proc. 14th Int'l Symposium on Distributed Computing (DISC'OO), LNCS #1914, pp. 164-178, 2000.
28. Ratnasamy S., Handley M., Francis P. and Karp R., A Scalable content-Addressable Network. Proc. ACM SIGCOMM Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication, ACM Press, pp. 161-172, 2001.
29. Rodrigues R and Liskov B., Reconfigurable Byzantine Fault-tolerant Atomic Memory. Brief annoucement in Proc. 24th ACM PODC, ACM Press, p. 386, 2004.
30. Rowstron A. and Druschel P., Pastry: Scalable, Distributed Object Location and Routing for Large Scale peer-to-Peer Systems. Proc. 18th IFIP/ACM Int'l Conf. on Distributed Systems Platforms (Middleware 2001), Springer-Verlag LNCS #2218, pp. 329-350, 2001.
31. Stoica I., Morris R., Liben-Nowell D., Karger D., Kaashoek M.F., Dabek F. and Balakrishnan H., Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. ACM/IEEE Transactions on Networking, 11(1): 17-32, 2003.
32. Thomas R.H., A Majority Consensus Approach to Concurrency Control for Multiple Copy Database. ACM Transactions on Database Systems, 4(2): 180-229, 1979.
33. Vitenberg R. and Friedman R., On the Locality of Consistency Conditions. Proc. 17th Int'l Symposium on Distributed Computing (DISC'03), LNCS #2848, pp. 92-105, 2003.
34. Zhao B., Kubiatowicz J. and Joseph A., Tapestry: An Infrastructure for Fault-Tolerant Widearea Location and Routing. Technical Report UCB/CSD-01-1141, U.C. Berkeley, 2001.