Lazy replication

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Lazy replication: exploiting the semantics of distributed services (extended abstract)

Full text

Pdf (433 KB)

Source

ACM SIGOPS Operating Systems Review archive
Volume 25 , Issue 1 (January 1991) table of contents

Pages: 49 - 55

Year of Publication: 1991

ISSN:0163-5980

Authors

Rivka Ladin	Digital Equipment Corp., Cambridge Research Laboratory, Cambridge, MA
Barbara Liskov	MIT Laboratory for Computer Science, Cambridge, MA
Liuba Shrira	MIT Laboratory for Computer Science, Cambridge, MA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 11, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/122140.122144 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Philip A. Bernstein , Nathan Goodman, An algorithm for concurrency control and recovery in replicated distributed databases, ACM Transactions on Database Systems (TODS), v.9 n.4, p.596-615, Dec. 1984 [doi>10.1145/1994.2207]
	2	K. Birman , T. Joseph, Exploiting virtual synchrony in distributed systems, Proceedings of the eleventh ACM Symposium on Operating systems principles, p.123-138, November 08-11, 1987, Austin, Texas, United States
	3	Andrew D. Birrell , Roy Levin , Michael D. Schroeder , Roger M. Needham, Grapevine: an exercise in distributed computing, Communications of the ACM, v.25 n.4, p.260-274, April 1982 [doi>10.1145/358468.358487]
	4	4. Farrell, K. A. A Deadlock Detection Scheme for Argus. Senior Thesis. Laboratory of Computer Science, M.I.T., Cambridge, MA.
	5	Michael J. Fischer , Alan Michael, Sacrificing serializability to attain high availability of data in an unreliable network, Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, March 29-31, 1982, Los Angeles, California [doi>10.1145/588111.588124]
	6	David K. Gifford, Weighted voting for replicated data, Proceedings of the seventh ACM symposium on Operating systems principles, p.150-162, December 10-12, 1979, Pacific Grove, California, United States [doi>10.1145/800215.806583]
	7	M. P. Herlihy , J. M. Wing, Axioms for concurrent objects, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.13-26, January 21-23, 1987, Munich, West Germany [doi>10.1145/41625.41627]
	8	D. Jing-Hwa Hwang , Deborah J Hwang, CONSTRUCTING A HIGHLY-AVAILABLE LOCATION SERVICE FOR A DISTRIBUTED ENVIRONMENT, Massachusetts Institute of Technology, Cambridge, MA, 1988
	9	Rivka Ladin , Barbara Liskov , Liuba Shrira, A technique for constructing highly available services, Algorithmica, v.3 n.3, p.393-420, 1988
	10	Rivka Ladin , Barbara Liskov , Liuba Shrira, Lazy replication: exploiting the semantics of distributed services, Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.43-57, August 22-24, 1990, Quebec City, Quebec, Canada [doi>10.1145/93385.93399]
	11	11. Ladin, R., A Method for Constructing Highly Available Services and An Algorithm for Distributed Garbage Collection. Ph.D. Th., M.I.T. Laboratory for Computer Science, Cambridge, MA, May 1989.
	12	Leslie Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, v.21 n.7, p.558-565, July 1978 [doi>10.1145/359545.359563]
	13	Butler W Lampson, Designing a global name service, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.1-10, August 11-13, 1986, Calgary, Alberta, Canada [doi>10.1145/10590.10591]
	14	Barbara Liskov , Rivka Ladin, Highly available distributed services and fault-tolerant distributed garbage collection, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.29-39, August 11-13, 1986, Calgary, Alberta, Canada [doi>10.1145/10590.10593]
	15	15. Liskov, B., Scheifler, R., Walker, E., and Weihl, W. Orphan Detection (Extended Abstract). Proc. of the 17th International Symposium on Fault-Tolerant Computing, IEEE, Pittsburgh, Pa., July, 1987, pp. 2-7.
	16	D. L. Mills, Network Time Protocol (version 1) specification and implementation, RFC Editor, 1988
	17	William E. Weihl, Distributed Version Management for Read-Only Actions, IEEE Transactions on Software Engineering, v.13 n.1, p.55-64, January 1987 [doi>10.1109/TSE.1987.232835]
	18	Gene T.J. Wuu , Arthur J. Bernstein, Efficient solutions to the replicated log and dictionary problems, Proceedings of the third annual ACM symposium on Principles of distributed computing, p.233-242, August 27-29, 1984, Vancouver, British Columbia, Canada [doi>10.1145/800222.806750]

CITED BY 3

	François Pacull , Alain Sandoz , André Schiper, Duplex: a distributed collaborative editing environment in large scale, Proceedings of the 1994 ACM conference on Computer supported cooperative work, p.165-173, October 22-26, 1994, Chapel Hill, North Carolina, United States
	Richard Lenz, Adaptive distributed data management with weak consistent replicated data, Proceedings of the 1996 ACM symposium on Applied Computing, p.178-185, February 17-19, 1996, Philadelphia, Pennsylvania, United States
	José Pereira , Luís Rodrigues , Rui Oliveira, Semantically Reliable Multicast: Definition, Implementation, and Performance Evaluation, IEEE Transactions on Computers, v.52 n.2, p.150-165, February 2003