Fast and fair randomized wait-free locks

DOI10.1007/S00446-024-00474-4MaRDI QIDQ7004076zbMATH OpenFDO

Authors Naama Ben-David, Guy E. Blelloch

Publication date 3 April 2025

Published in Distributed Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00446-024-00474-4

zbMATH Keywords

locksrandomized algorithmwait-freedom

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15) Randomized algorithms (68W20)

Cites work

• A competitive analysis for balanced transactional memory workloads
• A tight RMR lower bound for randomized mutual exclusion
• Concurrent manipulation of binary search trees
• Deterministic coin tossing with applications to optimal parallel list ranking
• Disentangling multi-object operations (extended abstract)
• scientific article; zbMATH DE number 1263230 (Why is no real title available?)
• Improved implementations of binary universal operations
• Linearizable implementations do not suffice for randomized distributed computation
• Making objects writable
• On interprocess communication. II: Algorithms
• Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion
• Proving time bounds for randomized distributed algorithms
• Randomized dining philosophers without fairness assumption
• Randomized mutual exclusion algorithms revisited
• Randomized mutual exclusion with constant amortized RMR complexity on the DSM
• Software transactional memory
• Thunks
• Toward a theory of transactional contention managers
• Transactional contention management as a non-clairvoyant scheduling problem

This page was built for publication: Fast and fair randomized wait-free locks

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