Disjoint-access-parallel implementations of strong shared memory primitives
From MaRDI portal
Publication:5361405
DOI10.1145/197917.198079zbMath1373.68102OpenAlexW2073256416MaRDI QIDQ5361405
Publication date: 29 September 2017
Published in: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/197917.198079
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (13)
Universal constructions for large objects ⋮ Highly concurrent multi-word synchronization ⋮ Lock-free deques and doubly linked lists ⋮ Distributed transactional memory for metric-space networks ⋮ Universal constructions that ensure disjoint-access parallelism and wait-freedom ⋮ Software transactional memory ⋮ Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions ⋮ Help when needed, but no more: efficient read/write partial snapshot ⋮ A single-version STM that is multi-versioned permissive ⋮ Inherent limitations on disjoint-access parallel implementations of transactional memory ⋮ Nonblocking \(k\)-compare-single-swap ⋮ The power of multiobjects. ⋮ Non-interference and local correctness in transactional memory
This page was built for publication: Disjoint-access-parallel implementations of strong shared memory primitives
