How to share concurrent wait-free variables
From MaRDI portal
Publication:4371684
DOI10.1145/234533.234556zbMath0882.68008OpenAlexW2166680701WikidataQ64216179 ScholiaQ64216179MaRDI QIDQ4371684
John Tromp, Paul M. B. Vitányi, Ming Li
Publication date: 22 January 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/1366
Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)
Related Items (11)
Self-stabilizing timestamps ⋮ Simple extensions of 1-writer atomic variable constructions to multiwriter ones ⋮ The space complexity of unbounded timestamps ⋮ The space complexity of long-lived and one-shot timestamp implementations ⋮ Wait-free computing ⋮ Randomized two-process wait-free test-and-set ⋮ Self-stabilization of wait-free shared memory objects ⋮ On interprocess communication and the implementation of multi-writer atomic registers ⋮ Finite-state concurrent programs can be expressed succinctly in triple normal form ⋮ Finite-state concurrent programs can be expressed in pairwise normal form ⋮ A classification of wait-free loop agreement tasks
This page was built for publication: How to share concurrent wait-free variables
