Optimistic concurrency control for abstract data types

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimistic concurrency control for abstract data types

Full text

Pdf (843 KB)

Source

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

Calgary, Alberta, Canada

Pages: 206 - 217

Year of Publication: 1986

ISBN:0-89791-198-9

Author

Maurice Herlihy

Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA

Sponsor

SIGOPS: ACM Special Interest Group on Operating Systems

Publisher

ACM New York, NY, USA

Bibliometrics

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

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/10590.10608 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	Rakesh Agrawal, Concurrency control and recovery in multiprocessor database machines: design and performance evaluation, 1983
	2	D.Z. Badal. Concurrency Control overhead or closer look at blocking vs. non-blocking concurrency control mechanisms. In Proceedings of the 5th Berkeley Workshop, pages 55-103. 1981.
	3	Michael James Carey, Modeling and evaluation of database concurrency control algorithms, 1983
	4	S. Ceri and S. Owicki. On the use of optimistic methods for concurrency control in distributed databases. In Proceedings of the 6th Berkeley Workshop, pages 117-130. 1982.
	5	Arvola Chan , Stephen Fox , Wen-Te K. Lin , Anil Nori , Daniel R. Ries, The implementation of an integrated concurrency control and recovery scheme, Proceedings of the 1982 ACM SIGMOD international conference on Management of data, June 02-04, 1982, Orlando, Florida [doi>10.1145/582353.582386]
	6	D.J. Dubourdieu. Implementation of distributed transactions. In Proceedings 1982 Berkeley Workshop on Distributed Data Management and Computer Networks, pages 81.94. 1982.
	7	Cynthia Dwork , Dale Skeen, The inherent cost of nonblocking commitment, Proceedings of the second annual ACM symposium on Principles of distributed computing, p.1-11, August 17-19, 1983, Montreal, Quebec, Canada [doi>10.1145/800221.806705]
	8	K. P. Eswaran , J. N. Gray , R. A. Lorie , I. L. Traiger, The notions of consistency and predicate locks in a database system, Communications of the ACM, v.19 n.11, p.624-633, Nov. 1976 [doi>10.1145/360363.360369]
	9	Peter Franaszek , John T. Robinson, Limitations of concurrency in transaction processing, ACM Transactions on Database Systems (TODS), v.10 n.1, p.1-28, March 1985 [doi>10.1145/3148.3160]
	10	D. Gawlick. Processing 'hot spots' in high performance systems. In Proceedings COMPCON'85. 19855.
	11	J. Gray. Notes on Database Operating Systems. Lecture Notes in Computer Science 60. Springer-Verlag, Berlin, 1978, pages 393-481.
	12	Theo Härder, Observations on optimistic concurrency control schemes, Information Systems, v.9 n.2, p.111-120, 1984 [doi>10.1016/0306-4379(84)90020-6]
	13	Maurice Herlihy, Comparing how atomicity mechanisms support replication, Proceedings of the fourth annual ACM symposium on Principles of distributed computing, p.102-110, August 1985, Minaki, Ontario, Canada [doi>10.1145/323596.323605]
	14	M.P. Herlihy. Availability vs. atomicity: concurrency control for replicated.data. Technical Report CMU- CS-85-108, Carnegie-Mellon University, February, 1985.
	15	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]
	16	Henry F. Korth, Locking Primitives in a Database System, Journal of the ACM (JACM), v.30 n.1, p.55-79, Jan. 1983 [doi>10.1145/322358.322363]
	17	H. T. Kung , John T. Robinson, On optimistic methods for concurrency control, ACM Transactions on Database Systems (TODS), v.6 n.2, p.213-226, June 1981 [doi>10.1145/319566.319567]
	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	George Lausen, Concurrency control in database systems: A step towards the integration of optimistic methods and locking, Proceedings of the ACM '82 conference, p.64-68, January 1982 [doi>10.1145/800174.809759]
	20	G. Lausen. Formal Aspects of optimistic concurrency control in a multiversion data base system. Information Systems 8(4):291-301, 1983.
	21	D.A. Menasce, and N. Nakanishi. Optimistic versus pessimistic concurrency control mechanisms in data base management systems. /nformation Systems 7(1):13-27, 1982.
	22	E. B. Moss, NESTED TRANSACTIONS: AN APPROACH TO RELIABLE DISTRIBUTED COMPUTING, Massachusetts Institute of Technology, Cambridge, MA, 1981
	23	Christos H. Papadimitriou, The serializability of concurrent database updates, Journal of the ACM (JACM), v.26 n.4, p.631-653, Oct. 1979 [doi>10.1145/322154.322158]
	24	David P. Reed, Implementing atomic actions on decentralized data, ACM Transactions on Computer Systems (TOCS), v.1 n.1, p.3-23, Feb. 1983 [doi>10.1145/357353.357355]
	25	Y.C. Tay, N. Goodman, and R. Suri. Perforrnance evaluation of locking in databases: a survey. Technical Report TR-17-84, Harvard Aiken Laboratory, 1984.
	26	R.H. Thomas. A solution to the concurrency control problem for multiple copy databases. In Prec. 16th IEEE Comput. Soc. Int. Conf. (COMPCON). Spring, 1978.
	27	William E. Weihl, Data-dependent concurrency control and recovery (Extended Abstract), Proceedings of the second annual ACM symposium on Principles of distributed computing, p.63-75, August 17-19, 1983, Montreal, Quebec, Canada [doi>10.1145/800221.806710]

CITED BY 8

	M. S. Atkins , M. Y. Coady, Adaptable concurrency control for atomic data types, ACM Transactions on Computer Systems (TOCS), v.10 n.3, p.190-225, Aug. 1992
	W. E. Weihl, Local atomicity properties: modular concurrency control for abstract data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.2, p.249-282, April 1989
	B. R. Badrinath , Krithi Ramamritham, Performance evaluation of semantics-based multilevel concurrency control protocols, ACM SIGMOD Record, v.19 n.2, p.163-172, Jun. 1990
	Maurice P. Herlihy , William E. Weihl, Hybrid concurrency control for abstract data types, Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.201-210, March 1988, Austin, Texas, United States
	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
	M. Satyanarayanan , James J. Kistler , Lily B. Mummert , Maria R. Ebling , Puneet Kumar , Qi Lu, Experience with disconnected operation in a mobile computing environment, Mobile & Location-Independent Computing Symposium on Mobile & Location-Independent Computing Symposium, p.2-2, August 02-03, 1993, Cambridge, Massachusetts
	Jean-François Pons , J. F. Vilarem, Mixed concurrency control: Dealing with heterogeneity in distributed database systems, Proceedings of the 14th International Conference on Very Large Data Bases, p.445-456, August 29-September 01, 1988
	Joel M. Crichlow, Combining optimism and pessimism to produce high availability in distributed transaction processing, ACM SIGOPS Operating Systems Review, v.28 n.3, p.43-64, July 1994