The Location-Based Paradigm for Replication: Achieving Efficiency and Availability in Distributed Systems

IEEE Transactions on Software Engineering

Volumn 21, Issue 1, 1995, Pages 1-18

  Triantafillou, Peter ^a   Taylor, David J ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Availability; concurrency control; distributed computing; partitionings; recovery; replication; transactions

Indexed keywords

ALGORITHMS; BATCH DATA PROCESSING; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; COMPUTER SIMULATION; CONCURRENCY CONTROL; DATA COMMUNICATION SYSTEMS; ERROR CORRECTION;

ATOMICITY; CONCURRENCY CONTROL ALGORITHM; CRASH RECOVERY ALGORITHM; LOCATION BASED PARADIGM; ONE COPY SYSTEMS; REPLICATION; SEMANTICS; SERIALIZABILITY; TRANSACTION BASED DISTRIBUTED SYSTEMS;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0029184478     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.341843     Document Type: Article

References (29)

1. D. Agrawal and A. El Abbadi, “The tree quorum protocol: An efficient approach for managing replicated data,” in Proc. Int. Conf. Very Large Data Bases, Aug. 1990.
2. P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Reading, MA: Addison-Wesley, 1987.
3. P. Bernstein and N. Goodman, “The failure and recovery problem for replicated databases,” in Proc. 2nd ACM Symp. Princip. Distrib. Comput., Aug. 1983, pp. 114-122.
4. K. Birman, “Replication and fault-tolerance in the ISIS system,” in Proc. 10th ACM Symp. Oper. Syst. Princip., Dec. 1985, pp. 79-86.
5. A. Demers et al., “Epidemic algorithms for replicated database maintenance,” in Proc. 6th ACM Symp. Princip. Distrib. Comput., Aug. 1987, pp. 1-12
6. D. Duchamp, “Analysis of transaction management performance,” in Proc. 12th ACM Symp. Operating Systems Principles, Dec. 1989, pp. 177-190.
7. A. El Abbadi and S. Toueg, “Availability in partitioned replicated databases,” ACM Trans. Database Syst., 14(2) pp. 264-290, June 1989.
8. A. El Abbadi and S. Toueg, “Availability in partitioned replicated batabases (extended abstract),” in Proc. 5th ACM Symp. Princip. Database Syst., Mar. 1986, pp. 240-251.
9. D. Gifford, “Weighted voting for replicated data,” in Proc. 7th ACM Symp. Oper. Syst. Princip., Dec. 1979, pp. 150-162.
10. G. Gordon, System Simulation. Englewood Cliffs, NJ: Prentice-Hall, 1978.
11. M. A. Greer, “Performance measurement of remote IPC”, M.Math thesis, Dep. of Computer Science, Univ. of Waterloo (1989).
12. M. Herlihy, “Concurrency versus availability: Atomicity mechanisms for replicated data,” ACM Trans. Comput. Syst., 5(3) pp. 249-274, Aug. 1987.
13. M. Herlihy, “Dynamic quorum adjustment for partitioned data,” ACM Trans. Database Syst., 12(2) pp. 170-194, June 1987.
14. M. Herlihy, “A quorum consensus method for abstract data types,” ACM Trans. Comput. Syst., 4(1) pp. 32-53, Feb. 1986.
15. ISIS, Modelling Communication Costs, discussion in the comp.sys.isis newsgroup, 1990.
16. T. A. Joseph and K. Birman, “Low cost management of replicated data in fault-tolerant distributed systems,” ACM Trans. Comput. Syst., 4(1) pp. 54-70, Feb. 1986.
17. W. H. Kohler, “A survey of techniques for synchronization and recovery in decentralized computing systems,” ACM Comput. Surveys, 13(2), pp. 149-185, June 1981.
18. A. Kumar, “Performance analysis of a hierarchical quorum consensus algorithm for replicated objects,” in Proc. 10th Int. Conf. Distrib. Comput. Syst., May 1990.
19. R. Ladin, B. Liskov, and L. Shrira, “A technique for constructing highly available services,” Laboratory for Computer Science, MIT, Tech. Rep. MIT/LCS/TR-409, Jan. 1988.
20. B. Lampson, “Atomic transactions,” in Lecture notes in Computer Science vol. 105. Distributed Systems: Architecture and Implementation. New York: Springer Verlag, pp. 246-265, 1981.
21. D. D. E. Long, “The Management of Replication in a Distributed System,” University of California, San Diego, Dep. of Computer Science, Ph.D. thesis (available as Tech. Rep. from the Univ. of California, Santa Cruz, UCSC-CRL-88-07) 1988.
22. B. M. Oki and B. Liskov, “Viewstamped replication: A new primary copy method to support highly available distributed systems,” in Proc. 7th ACM Symp. Princip. Distrib. Comput. Aug. 1988, pp. 8-17.
23. B. M. Oki, “Viewstamped replication for highly available distributed systems,” Lab. for Computer Science, Massachusetts Inst. of Technology, Ph.D. thesis, (also published as MIT/LCS/TR-423), Aug. 1988.
24. C. Papadimitriou, “The serializability of concurrent updates,” J. ACM, 26(4) pp. 631-653, Oct. 1979.
25. J-F. Paris, “Voting with witnesses: A consistency scheme for replicated files,” in Proc. 6th Int. Conf. Distrib. Comput. Syst., May 1986, pp.606-612.
26. D.J. Taylor, “How big can an atomic action be,” in Proc. 5th Symp. Reliability in Distrib. Software and Database Syst., Jan. 1986, pp. 121-124.
27. P. Triantafillou and D. J. Taylor, “Efficiently maintaining availability in the presence of partitionings in distributed systems,” in Proc. 7th Int. Conf. Data Eng., IEEE, Apr. 8-12, 1991, pp. 34-41.
28. P. Triantafillou, “Employing replication to achieve efficiency and high availability in distributed systems,” Ph.D. thesis, Univ. of Waterloo, July 1991, (available as Res. Rep. CS-91-28).
29. P. Triantafillou and D. J. Taylor, “Multi-class replicated data management: Exploiting replication to improve efficiency,” IEEE Trans. Parallel and Distrib. Syst., pp. 121-138, Feb. 1994.