Universal constructions for multi-object operations

DOI10.1145/224964.224985MaRDI QIDQ5361453zbMATH OpenOpenAlexDBLPWikidataFDO

Authors James H. Anderson, Mark Moir

Publication date 29 September 2017

Published in Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/224964.224985

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cited in

(14)

• The power of multiobjects.
• Adaptive mutual exclusion with local spinning
• Highly-efficient wait-free synchronization
• Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
• Asynchronous group mutual exclusion
• 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
• Lower bounds on the amortized time complexity of shared objects
• Faster randomized repeated choice and DCAS
• Strongly linearizable LL/SC from CAS
• A general lock-free algorithm using compare-and-swap

This page was built for publication: Universal constructions for multi-object operations

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