Exclusion requirements and potential concurrency for composite objects

Concurrent object-oriented systems must prevent the interference that may arise when multiple threads simultaneously access shared components. We present a simple approach for implementing flexible locking strategies in an object-oriented system, in which the components themselves may be composite objects. We express exclusion requirements as sets of conflict pairs on component interfaces. Given knowledge of the dependency between the interface of a composite object and its internal components, we show how external exclusion requirements can be calculated from internal requirements, and further, how any potential concurrent activity outside an object can be projected into potential concurrency for the internal components. With our approach we can defer the distribution of locks in the system until deployment: the placement of locks and choice of lock type for a component can depend on its operating environment. A Galois connection between the outward mapping of exclusion requirements, and the inward mapping of potential concurrency, limits how many locks are worth considering. In this paper we only deal with exclusion control, including mutexes, read–write locks and read–write sets, and do not cover state-dependent locking or transaction-based approaches. © 2005 Elsevier B.V. All rights reserved. ∗ Corresponding author. E-mail addresses: [email protected] (A. Shanneb), [email protected] (J. Potter), [email protected] (J. Noble). 0167-6423/$ see front matter © 2005 Elsevier B.V. All rights reserved. doi:10.1016/j.scico.2005.03.004 A. Shanneb et al. / Science of Computer Programming 58 (2005) 344–365 345