Universal constructions for multi-object operations

DOI10.1145/224964.224985zbMath1373.68131DBLPconf/podc/AndersonM95OpenAlexW1964252984WikidataQ56586763 ScholiaQ56586763MaRDI QIDQ5361453

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)

Related Items (9)

A general lock-free algorithm using compare-and-swap ⋮ Universal constructions for large objects ⋮ Highly concurrent multi-word synchronization ⋮ Adaptive mutual exclusion with local spinning ⋮ Universal constructions that ensure disjoint-access parallelism and wait-freedom ⋮ Using local-spin k -exclusion algorithms to improve wait-free object implementations ⋮ Asynchronous group mutual exclusion ⋮ Highly-efficient wait-free synchronization ⋮ The power of multiobjects.

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