Probabilistic quorum systems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Probabilistic quorum systems

Full text

Pdf (679 KB)

Source

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

Santa Barbara, California, United States

Pages: 267 - 273

Year of Publication: 1997

ISBN:0-89791-952-1

Authors

Dahlia Malkhi	AT&T Labs--Research, 180 Park Avenue, Florham Park, NJ
Michael Reiter	AT&T Labs--Research, 180 Park Avenue, Florham Park, NJ
Rebecca Wright	AT&T Labs--Research, 180 Park Avenue, Florham Park, NJ

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): 4, Downloads (12 Months): 33, Citation Count: 9

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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

	AE91	Divyakant Agrawal , Amr El Abbadi, An efficient and fault-tolerant solution for distributed mutual exclusion, ACM Transactions on Computer Systems (TOCS), v.9 n.1, p.1-20, Feb. 1991 [doi>10.1145/103727.103728]
	AR92	Y. Aumann and M. Rabin. Clock construction in fully asynchronous parallel systems and PRAM simulation. In Proceedings o} the 33~ {BBB $pmposium on FoundG- lions ol Computer Science, pages 147-156, October 1992.
	CP96	Ramón Cáceres , Venkata N. Padmanabhan, Fast and scalable handoffs for wireless internetworks, Proceedings of the 2nd annual international conference on Mobile computing and networking, p.56-66, November 1996, Rye, New York, United States [doi>10.1145/236387.236405]
	BG87	D. Barbara , H. Garcia-Molina, The reliability of voting mechanisms, IEEE Transactions on Computers, v.36 n.10, p.1197-1208, Oct. 1987 [doi>10.1109/TC.1987.1676860]
	CAA90	Shun Yan Cheung , Mostafa H. Ammar , Mustaque Ahamad, The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data, Proceedings of the Sixth International Conference on Data Engineering, p.438-445, February 05-09, 1990
	CLR89	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	ET89	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]
	GB85	Hector Garcia-Molina , Daniel Barbara, How to assign votes in a distributed system, Journal of the ACM (JACM), v.32 n.4, p.841-860, Oct. 1985 [doi>10.1145/4221.4223]
	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]
	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]
	JP96	D. Johnson and C. Perkins. Route optimization in Mobile IP, lnternet Dra}t, Internet Engineering Task Force, February 1996.
	KPRR92	Z. M. Kedem , K. V. Palem , M. O. Rabin , A. Raghunathan, Efficient program transformations for resilient parallel computation via randomization (preliminary version), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.306-317, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129742]
	Lam83	Butler W. Lampson, Hints for computer system design, ACM SIGOPS Operating Systems Review, v.17 n.5, p.33-48, October 1983
	LS79	B. Lampson and P.. Sproul. An open operating system for a single-user machine. Operating Systems Reviem, 13(5):98- 105, 1979.
	Mae85	Mamoru Maekawa, A N algorithm for mutual exclusion in decentralized systems, ACM Transactions on Computer Systems (TOCS), v.3 n.2, p.145-159, May 1985 [doi>10.1145/214438.214445]
	MMR97	D. Malkhi, M. Merritt and O. Rodeh. Secure multicast in a WAN. The lnttenationai Constance on Distributed Computin~ System4 (ICDCS), Baltimore, May 1997, to be published.
	MR97	Dahlia Malkhi , Michael Reiter, Byzantine quorum systems, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.569-578, May 04-06, 1997, El Paso, Texas, United States [doi>10.1145/258533.258650]
	MW77	M. McQuillan and D. Walden. The ARPA network design decisions. In Proceedings el Computer Net~eorkd I, pages 243-289, August 199'7.
	NW94	M. Naor and A. Wool. The load, capacity, and availability of quorum systems. In Proceedings oy the SSth IBBB Symposium on Foundations el Computer $cience, page, 214--225, November 1994.
	PW95a	David Peleg , Avishai Wool, Crumbling walls: a class of practical and efficient quorum systems, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, p.120-129, August 20-23, 1995, Ottowa, Ontario, Canada [doi>10.1145/224964.224978]
	PW95b	David Peleg , Avishai Wool, The availability of quorum systems, Information and Computation, v.123 n.2, p.210-223, Dec. 1995 [doi>10.1006/inco.1995.1169]
	Sch90	Fred B. Schneider, Implementing fault-tolerant services using the state machine approach: a tutorial, ACM Computing Surveys (CSUR), v.22 n.4, p.299-319, Dec. 1990 [doi>10.1145/98163.98167]
	Smi81	James E. Smith, A study of branch prediction strategies, Proceedings of the 8th annual symposium on Computer Architecture, p.135-148, May 12-14, 1981, Minneapolis, Minnesota, United States
	Tho79	Robert H. Thomas, A Majority consensus approach to concurrency control for multiple copy databases, ACM Transactions on Database Systems (TODS), v.4 n.2, p.180-209, June 1979 [doi>10.1145/320071.320076]

CITED BY 9

	Hyunyoung Lee , Jennifer L. Welch, Specification, implementation and application of randomized regular registers (brief announcement), Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, p.338, July 16-19, 2000, Portland, Oregon, United States
	Hyunyoung Lee , Jennifer L. Welch, Randomized shared queues, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, p.311-313, August 2001, Newport, Rhode Island, United States
	Francesco De Pellegrini , Iacopo Carreras , Daniele Miorandi , Imrich Chlamtac , Corrado Moiso, R-P2P: a data centric DTN middleware with interconnected throwboxes, Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems, p.1-10, September 23-25, 2008, Turin, Italy
	Moni Naor , Udi Wieder, Novel architectures for P2P applications: the continuous-discrete approach, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, June 07-09, 2003, San Diego, California, USA
	Ronaldo A. Ferreira , Murali K. Ramanathan , Ananth Grama , Suresh Jagannathan, Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems, IEEE Transactions on Parallel and Distributed Systems, v.18 n.5, p.686-696, May 2007
	Asad Awan , Ronaldo A. Ferreira , Suresh Jagannathan , Ananth Grama, Unstructured peer-to-peer networks for sharing processor cycles, Parallel Computing, v.32 n.2, p.115-135, February 2006
	Dahlia Malkhi , Michael Reiter, Byzantine quorum systems, Distributed Computing, v.11 n.4, p.203-213, October 1998
	Dahlia Malkhi , Michael K. Reiter , Avishai Wool , Rebecca N. Wright, Probabilistic quorum systems, Information and Computation, v.170 n.2, p.184-206, November 1, 2001
	Dahlia Malkhi , Michael K. Reiter, An Architecture for Survivable Coordination in Large Distributed Systems, IEEE Transactions on Knowledge and Data Engineering, v.12 n.2, p.187-202, March 2000