Abstract
As persistent object store technology reaches a mature state with respect to orthogonal persistence support, the lack of efficient and flexible concurrency control that could make them an attractive alternative to database systems is cruelly felt. In the search for more flexibility, an increasing trend towards independent control over the basic transaction properties of atomicity, permanence and serializability has emerged [11, 13].
Following this approach, this paper propose a new mechanism, called locking capability graph, which allows quick prototy** of concurrency control independently of other transaction properties. This mechanism allows (1) generic conflict detection based on a no conflict with relationship between lock owners, (2) arbitrary delegation of locks, and (3), automated tracking of dependencies between lock owners. The mechanism is flexible enough to support a variety of popular transaction models’ concurrency control. Our measurements using a first prototype show that a nested transactions’ locking protocol, built with locking capability graph, outperforms significantly other known implementations of a lock manager dedicated to this protocol.
This work has been funded by ESPRIT BRA project FIDE2.
The author is currently seconded to the computing sciences department of the University of Glasgow by the RODIN project, INRIA Rocquencourt, France.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Michael J. Carey, David J. DeWitt, and Jeffrey F. Naughton. The 007 Benchmark. Technical report, Computer Sciences Departement, University of Wisconsin-Madison, April 1993.
Laurent Daynès and Olivier Gruber. Nested actions in Eos. In 5th Proc. of International Workshop on Persistent Object Systems, pages 115–138. Springer-Verlag, 1992.
Laurent Daynès, Olivier Gruber, and Patrick Valduriez. Object locking in OODBMS clients supporting multiple nested transactions. To appear in “Pro-ceedings of the 11th International Conference on Data Engineering, Tai-pei (Taiwan)”, March 1995.
Vibby Gottemukkala and Tobin J. Lehman. Locking and latching in a memory-resident database system. Proc. of International Conference on Very Large Database, pages 533–544, 1992.
Jim Gray and Andreas Reuter. Transaction Processing: Concept and Techniques. Morgan Kaufmann, 1993.
Olivier Gruber and Patrick Valduriez. An object-oriented foundation for desktop computing. In Second International Conference on Cooperative Information Systems, 1994.
T. Härder, M. Profit, and H. Schöning. Supporting parallelism in engineering databases by nested transactions. Technical Report 34/92, Kaiserslautern University, December 1992.
T. Härder and K. Rothermel. Concurrency control issues in nested transactions. VLDB Journal, 2(1):39–74, 1993.
J. Eliot B. Moss. Nested Transactions: An Approach to Reliable Distributed Computing. PhD thesis, Massachussets Institute of Technology, April 1981.
Calton Pu, Gail E. Kaiser, and Norman Hutchinson. Split-transactions for open-ended activities. In Proc. of ACM SIGMOD International Conference on Management of Data, pages 26–37, Los Angeles, California, August 1988.
M. Satyanarayanan, Henry H. Mashburn, Puneet Kumar, David C. Steere, and James J. Kistler. Lightweight recoverable virtual memory. In Proceedings of the Fourteenth ACM Symposium on Operating System Principles, pages 146–160, Asheville, NC, December 1993.
Santosh K. Shrivastava and Stuart M. Wheater. Implementing fault-tolerant distributed applications using objects and multi-coloured actions. In Proc. of International Conference on Distributed Computing System, pages 203–210, Paris, France, May 1990.
David Stemple and Ron Morrison. Specifying flexible concurrency control schemes: an abstract operational approach. Technical Report FIDE/92/35, ESPRIT BRA project n 3070, FIDE, 1992.
Edward F. Walker, Richard Floyd, and Paul Neves. Asynchronous remote operation execution in distributed systems. In Proc. of International Conference on Distributed Computing System, pages 253–259, Paris, France, May 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 British Computer Society
About this paper
Cite this paper
Daynès, L., Gruber, O. (1995). Customizing Concurrency Controls using Graph of Locking Capabilities. In: Atkinson, M., Maier, D., Benzaken, V. (eds) Persistent Object Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-2122-0_13
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2122-0_13
Publisher Name: Springer, London
Print ISBN: 978-3-540-19912-0
Online ISBN: 978-1-4471-2122-0
eBook Packages: Springer Book Archive