; this includes mutexes, read-write locks and read-write sets, but does not cover state-dependent locking or transaction-based approaches. In general we express exclusion requirements as sets of conflict pairs on component interfaces; elsewhere (Potter, Shanneb and Yu 2004) we have demonstrated the effectiveness of a general-purpose exclusion lock that can provide any required exclusion. We presume knowledge of the dependency between the interface of a composite object and its internal components.This work extends and simplifies the work on exclusion algebra for composite objects (Noble, Holmes and Potter 2000). Our major contribution is to distinguish between the control required internally and that provided externally. This clarifies the role of the so-called upward and downward mappings of the earlier work. We also offer a succinct mathematical basis for our model.
展开▼
