Fast timing-based algorithms

DOI10.1007/S004460050020MaRDI QIDQ5137323zbMATH OpenOpenAlexFDO

Authors Gadi Taubenfeld, Rajeev Alur

Publication date 2 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004460050020

zbMATH Keywords

consensusmutual exclusionshared-memory algorithmscontention-free complexitytiming-based model

Mathematics Subject Classification ID

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

Recommendations

• Time-Adaptive Algorithms for Synchronization
• scientific article; zbMATH DE number 2006640
• Time-adaptive algorithms for synchronization
• Time bounds for mutual exclusion and related problems
• Time/contention trade-offs for multiprocessor synchronization

Cites work

• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• Adaptive solutions to the mutual exclusion problem
• An axiomatic proof technique for parallel programs
• Bounds on shared memory for mutual exclusion
• Impossibility of distributed consensus with one faulty process
• Improving fast mutual exclusion
• Proving Liveness Properties of Concurrent Programs
• Reaching Agreement in the Presence of Faults
• Timing verification by successive approximation

Cited in

(9)

• Are wait-free algorithms fast?
• A faster parameterized algorithm for temporal matching
• Time/contention trade-offs for multiprocessor synchronization
• A visit to mutual exclusion in seven dates
• Faster Update Time for Turnstile Streaming Algorithms
• Timing-based mutual exclusion with local spinning. (Extended abstract)
• Efficient vector time with dynamic process creation and termination
• Temporal accuracy of FastRK3
• Time-adaptive algorithms for synchronization

This page was built for publication: Fast timing-based algorithms

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