How to share concurrent wait-free variables

DOI10.1145/234533.234556MaRDI QIDQ4371684zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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, http://www.acm.org/pubs/contents/journals/jacm/1996-43/

zbMATH Keywords

distributed systems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Recommendations

• Randomized naming using wait-free shared variables
• scientific article; zbMATH DE number 1546501
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• A shared-variable concurrency analysis of multi-threaded object-oriented programs
• A Deadlock-Free Semantics for Shared Memory Concurrency
• scientific article; zbMATH DE number 756078
• Waiting in concurrent algorithms
• Highly-efficient wait-free synchronization
• A Sound and Complete Shared-Variable Concurrency Model for Multi-threaded Java Programs

Cited in

(12)

• Towards an understanding of unbounded variables in asynchronous systems
• A classification of wait-free loop agreement tasks
• Self-stabilizing timestamps
• Simple extensions of 1-writer atomic variable constructions to multiwriter ones
• The space complexity of unbounded timestamps
• Randomized two-process wait-free test-and-set
• Algorithms and Computation
• Finite-state concurrent programs can be expressed succinctly in triple normal form
• Finite-state concurrent programs can be expressed in pairwise normal form
• Wait-free computing
• Self-stabilization of wait-free shared memory objects
• On interprocess communication and the implementation of multi-writer atomic registers

This page was built for publication: How to share concurrent wait-free variables

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