Disjoint-access-parallel implementations of strong shared memory primitives

DOI10.1145/197917.198079MaRDI QIDQ5361405zbMATH OpenOpenAlexFDO

Authors Amos Israeli, Lihu Rappoport

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

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited in

(18)

• The power of multiobjects.
• Distributed transactional memory for metric-space networks
• Nonblocking \(k\)-compare-single-swap
• Non-interference and local correctness in transactional memory
• Lock-free deques and doubly linked lists
• 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
• Highly concurrent multi-word synchronization
• Efficient multi-word compare and swap
• Ll/SC and atomic copy: constant time, space efficient implementations using only pointer-width CAS
• 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
• Faster randomized repeated choice and DCAS
• Strongly linearizable LL/SC from CAS
• History-independent concurrent objects

This page was built for publication: Disjoint-access-parallel implementations of strong shared memory primitives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361405)