Abstract
Both papers in this session were about enhancing pessimistic R/W schemes for concurrency control. In the first Andrea Skarra described extensions to a 2PL scheme to take advantage of the semantics of operations on index sets. Use of an extra locking mode offers potentially greater concurrency. The system had been implemented, but as yet there were no hard figures on the performance. In discussion a number of detailed suggestions were made: path expressions could be used to control the invocation order of operations (not considered); an optimistic strategy might be better suited to handling operation semantics (not practicable with the current server architecture, but certainly worth bearing in mind). Ron Morrison thought that most production systems handle indexes specially anyway, and that solid experimental evidence was needed before additional lock modes could be justified.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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
Moody, K. (1995). Concurrency. 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_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2122-0_11
Publisher Name: Springer, London
Print ISBN: 978-3-540-19912-0
Online ISBN: 978-1-4471-2122-0
eBook Packages: Springer Book Archive