Improved implementations of binary universal operations
From MaRDI portal
Publication:3196625
DOI10.1145/502102.502105zbMath1323.68026OpenAlexW2065224821MaRDI QIDQ3196625
Publication date: 30 October 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/502102.502105
wait-free algorithmsasynchronous shared-memory systemscontention-sensitive algorithmsdeterministic coin tossingload-linked/store-conditional operationsuniversal operations
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (4)
Bounded-wait combining: constructing robust and high-throughput shared objects ⋮ Built-in coloring for highly-concurrent doubly-linked lists ⋮ Highly concurrent multi-word synchronization ⋮ Universal constructions that ensure disjoint-access parallelism and wait-freedom
This page was built for publication: Improved implementations of binary universal operations