Increasing the resilience of atomic commit, at no additional cost

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Increasing the resilience of atomic commit, at no additional cost

Full text

Pdf (953 KB)

Source

Symposium on Principles of Database Systems archive
Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents

San Jose, California, United States

Pages: 245 - 254

Year of Publication: 1995

ISBN:0-89791-730-8

Authors

Idit Keidar	Computer Science Institute, The Hebrew University of Jerusalem
Danny Dolev	Computer Science Institute, The Hebrew University of Jerusalem

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 18, Citation Count: 8

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/212433.212468 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.

	BHG87	Philip A. Bernstein , Vassco Hadzilacos , Nathan Goodman, Concurrency control and recovery in database systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1987
	CK85	David Cheung , Tiko Kameda, Site optimal termination protocols for a distributed database under network partitioning, Proceedings of the fourth annual ACM symposium on Principles of distributed computing, p.111-121, August 1985, Minaki, Ontario, Canada [doi>10.1145/323596.323606]
	CR83	Francis Chin , K. V. S. Ramarao, Optimal termination protocols for network partitioning, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia [doi>10.1145/588058.588064]
	EASC85	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]
	EAT89	A. El Abbadi , S. Toueg, Maintaining availability in partitioned replicated databases, ACM Transactions on Database Systems (TODS), v.14 n.2, p.264-290, June 1989 [doi>10.1145/63500.63501]
	Gif79	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]
	GM82	H. Garcia-Molina. Elections in a Distributed Computing System. IEEE Transactions on Computers, C-31, NO.1:48-59, Jan. 1982.
	Gra78	Jim Gray, Notes on Data Base Operating Systems, Operating Systems, An Advanced Course, p.393-481, January 1978
	Her86	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]
	Her87	Maurice Herlihy, Concurrency versus availability: atomicity mechanisms for replicated data, ACM Transactions on Computer Systems (TOCS), v.5 n.3, p.249-274, Aug. 1987 [doi>10.1145/24068.27643]
	KD94	I. Keidar and D Dolev. Increasing the Resilience of Atomic Commit, at No Additional Cost. Technical Report CS94-18, Institute of Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel, 1994.
	Kei94	I. Keid#r. A Highly Available Paradigm for Consistent Object Replication. Master's thesis, Institute of Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel, 1994. Also available as Technical Report CS95-5.
	Ske82	D. Skeen. A Quorum-B#sed Commit Protocol. In Berkeley Workshop on Distmbuted Data Management and Computer Networks, number 6, p#ges 69-80, Feb. 1982.
	SS83	D. Skeen and M. Stonebraker. A Formal Model of Crash Recovery in a Distributed System. IEEE Transactzon's on Software Engineering, SE- 9 NO.3, May 1983.

CITED BY 8

	Theodore L. Willke , Nicholas F. Maxemchuk, Coordinated interaction using reliable broadcast in mobile wireless networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.51 n.4, p.1052-1059, March, 2007
	Danny Dolev , Dalia Malki, The Transis approach to high availability cluster communication, Communications of the ACM, v.39 n.4, p.64-70, April 1996
	Rachid Guerraoui, Non-blocking atomic commit in asynchronous distributed systems with failure detectors, Distributed Computing, v.15 n.1, p.17-25, January 2002
	Idit Keidar , Danny Dolev, Efficient message ordering in dynamic networks, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.68-76, May 23-26, 1996, Philadelphia, Pennsylvania, United States
	Danny Dolev , Idit Keidar , Esti Yeger Lotem, Dynamic voting for consistent primary components, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.63-71, August 21-24, 1997, Santa Barbara, California, United States
	Randal Burns, Fastpath Optimizations for Cluster Recovery in Shared-Disk Systems, Proceedings of the 2004 ACM/IEEE conference on Supercomputing, p.5, November 06-12, 2004
	Özalp Babaoğlu , Alberto Bartoli , Gianluca Dini, Enriched View Synchrony: A Programming Paradigm for Partitionable Asynchronous Distributed Systems, IEEE Transactions on Computers, v.46 n.6, p.642-658, June 1997
	Haifeng Yu , Amin Vahdat, Consistent and automatic replica regeneration, ACM Transactions on Storage (TOS), v.1 n.1, p.3-37, February 2005