Universal constructions for large objects
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 load-linked, store-conditional, and validate operations on a “large” multi-word shared variable. Before presenting our constructions, we show that these operations can be efficiently implemented from similar one-word primitives.
KeywordsLarge Object Space Overhead Universal Construction Shared Queue Private Copy
Unable to display preview. Download preview PDF.
- J. Anderson and M. Moir, “Universal Constructions for Multi-Object Operations”, to appear in the Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, 1995.Google Scholar
- G. Barnes, “A Method for Implementing Lock-Free Shared Data Structures”, Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, 1993, pp. 261–270.Google Scholar
- A. Israeli and L. Rappoport, “Disjoint-Access-Parallel Implementations of Strong Shared Memory Primitives”, Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, August 1994, pp. 151–160.Google Scholar
- N. Shavit and D. Touitou, “Software Transactional Memory”, to appear in the Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, 1995.Google Scholar