Issue No. 12 - December (1999 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.819952
<p><b>Abstract</b>—We present lock-free and wait-free universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object state, which is impractical for large objects. Previous attempts to address this problem require programmers to explicitly fragment large objects into smaller, more manageable pieces, paying particular attention to how such pieces are copied. In contrast, our constructions are designed to largely shield programmers from this fragmentation. Furthermore, for many objects, our constructions result in lower copying overhead than previous ones. Fragmentation is achieved in our constructions through the use of <it>load-linked</it>, <it>store-conditional</it>, and <it>validate</it> operations on a “large” multiword shared variable. Before presenting our constructions, we show how these operations can be efficiently implemented from similar one-word primitives.</p>
Concurrency, lock-free, nonblocking synchronization, shared objects, wait-free.
M. Moir and J. H. Anderson, "Universal Constructions for Large Objects," in IEEE Transactions on Parallel & Distributed Systems, vol. 10, no. , pp. 1317-1332, 1999.