article · 1996
Efficient support for customizing concurrency control in Persistent Java
Laurent Daynes, Malcolm P. Atkinson, Patrick Valduriez
Cited by 0Abstract and details only
Abstract
We report on the issues raised when designing a customizable locking mechanism for Persistent Java, a type-safe, object-oriented, orthogonally persistent system based on the language Java. Customizable locking mechanisms are supported by locking capabilities. A locking capability is a book-keeper of locks that automatically acquires locks with a customizable conflict detection mechanism. It implements the concepts of delegation of locks and ignorable conflicts, automatically keeps track of the dependencies created because of allowance of conflicts, supports querying of details about these dependencies, and supports the setting of user-defined notifications for conflicts that can't be ignored. Locking capabilities don't change the Java language specification, and allow use of any Java classes without changing a single line of their code to implement the body of transactions. We also present several novel techniques to implement efficiently this customizable locking mechanism in a persis...
Cite this paper
Daynes, L., Atkinson, M. P., & Valduriez, P. (1996). Efficient support for customizing concurrency control in Persistent Java.
Daynes, Laurent, et al. “Efficient support for customizing concurrency control in Persistent Java.” 1996.
Daynes, Laurent, Malcolm P. Atkinson, and Patrick Valduriez. 1996. “Efficient support for customizing concurrency control in Persistent Java.”
Daynes, L., Atkinson, M.P. and Valduriez, P. (1996) ‘Efficient support for customizing concurrency control in Persistent Java’.
@article{daynes1996efficient,
title = {{Efficient support for customizing concurrency control in Persistent Java}},
author = {Daynes, Laurent and Atkinson, Malcolm P. and Valduriez, Patrick},
year = {1996}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.