Lazy replication: exploiting the semantics of distributed services

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Lazy replication: exploiting the semantics of distributed services

Full text

Pdf (2.01 MB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the ninth annual ACM symposium on Principles of distributed computing table of contents

Quebec City, Quebec, Canada

Pages: 43 - 57

Year of Publication: 1990

ISBN:0-89791-404-X

Authors

Rivka Ladin	Digital Equipment Corp., One Kendall Square, Cambridge, MA
Barbara Liskov	MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA
Liuba Shrira	MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 35, Citation Count: 19

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/93385.93399 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	Peter A. Alsberg , John D. Day, A principle for resilient sharing of distributed resources, Proceedings of the 2nd international conference on Software engineering, p.562-570, October 13-15, 1976, San Francisco, California, United States
	2	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]
	3	Kenneth P. Birman , Thomas A. Joseph, Reliable communication in the presence of failures, ACM Transactions on Computer Systems (TOCS), v.5 n.1, p.47-76, Feb. 1987 [doi>10.1145/7351.7478]
	4	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
	5	Kenneth P. Birman , Andre Schiper , Patrick Stephenson, Fast Causal Multicast, Cornell University, Ithaca, NY, 1990
	6	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]
	7	Amr El Abbadi , Sam Toueg, Availability in partitioned replicated databases, Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, p.240-251, March 24-26, 1986, Cambridge, Massachusetts, United States [doi>10.1145/6012.15418]
	8	Amr El Abbadi , Dale Skeen , Flaviu Cristian, An efficient, fault-tolerant protocol for replicated data management, Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems, p.215-229, March 25-27, 1985, Portland, Oregon, United States [doi>10.1145/325405.325443]
	9	Farrell, K.A. A Deadlock Detection Scheme for Argus. Senior Thesis. Laboratory of Computer Science, M.I.T., Cambridge, MA.
	10	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]
	11	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]
	12	A. Heddaya , M. Hsu , W. Weihl, Two phase gossip: managing distributed event histories, Information Sciences: an International Journal, v.49 n.1-3, p.35-57, Oct.-Dec. 1989 [doi>10.1016/0020-0255(89)90023-6]
	13	Maurice Herlihy, A quorum-consensus replication method for abstract data types, ACM Transactions on Computer Systems (TOCS), v.4 n.1, p.32-53, Feb. 1986 [doi>10.1145/6306.6308]
	14	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]
	15	D. Jing-Hwa Hwang , Deborah J Hwang, CONSTRUCTING A HIGHLY-AVAILABLE LOCATION SERVICE FOR A DISTRIBUTED ENVIRONMENT, Massachusetts Institute of Technology, Cambridge, MA, 1988
	16	Rivka Ladin , Barbara Liskov , Liuba Shrira, A technique for constructing highly available services, Algorithmica, v.3 n.3, p.393-420, 1988
	17	Laflin, 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.
	18	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]
	19	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]
	20	Lampson, B. W., and Sturgis, H. E. Crash Recovery in a Distributed Data Storage System. Xerox Research Center, Palo Alto, Ca., 1979.
	21	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]
	22	Liskov, B., Scheifler, R., Walker, E., and Weihl, W. Orphan Detection (Extended Abstract). Proe. of the 17th International Symposium on Fault-Tolerant Computing, IEEE, Pittsburgh, Pa., July, 1987, pp. 2-7.
	23	Barbara Liskov, Distributed programming in Argus, Communications of the ACM, v.31 n.3, p.300-312, March 1988 [doi>10.1145/42392.42399]
	24	Mills, D.L. Network Time Protocol (versionl) specification and implementation. DARPA-Internet Report RFC-1059, DARPA, 1988.
	25	Brian M. Oki , Barbara H. Liskov, Viewstamped replication: a general primary copy, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, p.8-17, August 15-17, 1988, Toronto, Ontario, Canada [doi>10.1145/62546.62549]
	26	B. M. Oki, VIEWSTAMPED REPLICATION FOR HIGHLY AVAILABLE DISTRIBUTED SYSTEMS, Massachusetts Institute of Technology, Cambridge, MA, 1988
	27	Parker, D. S., Popek, G. J., Rudisin, G., Stoughton, A., Walker, B., Walton, E., Chow, l., Edwards, D., Kiser, S., and Kline, C. "Detection of Mutual Inconsistency in Distributed Systems". IEEE Transactions on Software Engineering SE-9 (May 1983), 240-247.
	28	Larry L. Peterson , Nick C. Buchholz , Richard D. Schlichting, Preserving and using context information in interprocess communication, ACM Transactions on Computer Systems (TOCS), v.7 n.3, p.217-246, Aug. 1989 [doi>10.1145/65000.65001]
	29	Richard D. Schlichting , Fred B. Schneider, Fail-stop processors: an approach to designing fault-tolerant computing systems, ACM Transactions on Computer Systems (TOCS), v.1 n.3, p.222-238, August 1983 [doi>10.1145/357369.357371]
	30	Skeert, D., and Wright, D. D. Increasing Availability in Partitioned Database Systems. Technical Report 83-581, Dept. of Computer Science, Comell University, Ithaca, N. Y., 1984.
	31	William E. Weihl, Distributed version management for read-only actions, IEEE Transactions on Software Engineering, v.13 n.1, p.55-64, Jan. 1987 [doi>10.1109/TSE.1987.232835]
	32	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 19

	K. Ravindran , K. K. Ramakrishnan, A naming system for feature-based service specification in distributed operating systems, Proceedings of the 1991 ACM SIGSMALL/PC symposium on Small systems, p.83-92, June 12-14, 1991, Toronto, Ontario, Canada
	Chaoying Ma, On building very large naming systems, Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring, September 21-23, 1992, Mont Saint-Michel, France
	Kenneth P. Birman, The process group approach to reliable distributed computing, Communications of the ACM, v.36 n.12, p.37-53, Dec. 1993
	Rivka Ladin , Barbara Liskov , Liuba Shrira, Lazy replication: exploiting the semantics of distributed services, Proceedings of the 4th workshop on ACM SIGOPS European workshop, p.1-6, September 03-05, 1990, Bologna, Italy
	Narayanan Krishnakumar , Arthur J. Bernstein, Bounded ignorance: a technique for increasing concurrency in a replicated system, ACM Transactions on Database Systems (TODS), v.19 n.4, p.586-625, Dec. 1994
	Ouri Wolfson , Sushil Jajodia , Yixiu Huang, An adaptive data replication algorithm, ACM Transactions on Database Systems (TODS), v.22 n.2, p.255-314, June 1997
	Woei-Jiunn Tsaur , Shi-Jinn Horng, Auditing Causal Relationships of Group Multicast Communications in Group-Oriented Distributed Systems, The Journal of Supercomputing, v.18 n.1, p.25-45, Jan. 2001
	Narayanan Krishnakumar , Arthur J. Bernstein, Bounded ignorance in replicated systems, Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.63-74, May 29-31, 1991, Denver, Colorado, United States
	André Schiper , Kenneth Birman , Pat Stephenson, Lightweight causal and atomic group multicast, ACM Transactions on Computer Systems (TOCS), v.9 n.3, p.272-314, Aug. 1991
	Calton Pu , Avraham Leff, Replica control in distributed systems: as asynchronous approach, ACM SIGMOD Record, v.20 n.2, p.377-386, June 1991
	Brigitte Kröll , Peter Widmayer, Distributing a search tree among a growing number of processors, ACM SIGMOD Record, v.23 n.2, p.265-276, June 1994
	Kenneth P. Birman , Bradford B. Glade, Reliability Through Consistency, IEEE Software, v.12 n.3, p.29-41, May 1995
	Roy Friedman , Roman Vitenberg , Gregory Chockler, On the composability of consistency conditions, Information Processing Letters, v.86 n.4, p.169-176, 31 May 2003
	Yuanyuan Zhao , Daniel Sturman , Sumeer Bhola, Subscription propagation in highly-available publish/subscribe middleware, Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware, October 18-22, 2004, Toronto, Canada
	Theodore Johnson , Padmashree Krishna, Lazy updates for distributed search structure, ACM SIGMOD Record, v.22 n.2, p.337-346, June 1, 1993
	Danny Dolev, Century papers at the first quarter-century milestone, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, p.3-4, July 23-26, 2006, Denver, Colorado, USA
	Ken Birman, A response to Cheriton and Skeen's criticism of causal and totally ordered communication, ACM SIGOPS Operating Systems Review, v.28 n.1, p.11-21, Jan. 1994
	Rivka Ladin , Barbara Liskov , Liuba Shrira, Lazy replication: exploiting the semantics of distributed services (extended abstract), ACM SIGOPS Operating Systems Review, v.25 n.1, p.49-55, Jan. 1991
	Hiroshi Horii , Hayato Yamana, Optimistic transactional active replication, Proceedings of the 2nd international conference on Ubiquitous information management and communication, January 31-February 01, 2008, Suwon, Korea