Disjoint-access-parallel implementations of strong shared memory primitives
From MaRDI portal
Publication:5361405
DOI10.1145/197917.198079zbMath1373.68102MaRDI 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
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Software transactional memory, Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions, Universal constructions that ensure disjoint-access parallelism and wait-freedom, Universal constructions for large objects, Lock-free deques and doubly linked lists, Highly concurrent multi-word synchronization, 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, The power of multiobjects., Distributed transactional memory for metric-space networks, Nonblocking \(k\)-compare-single-swap, Non-interference and local correctness in transactional memory
