Fast timing-based algorithms
From MaRDI portal
Recommendations
Cites work
- Adaptive solutions to the mutual exclusion problem
- An axiomatic proof technique for parallel programs
- Bounds on shared memory for mutual exclusion
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- 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
(12)- Efficient vector time with dynamic process creation and termination
- Time bounds for real-time process control in the presence of timing uncertainty
- Limitations of fast consistency conditions for distributed shared memories
- Time/contention trade-offs for multiprocessor synchronization
- A faster parameterized algorithm for temporal matching
- A visit to mutual exclusion in seven dates
- Temporal accuracy of FastRK3
- Time-adaptive algorithms for synchronization
- Are wait-free algorithms fast?
- Time-Adaptive Algorithms for Synchronization
- Faster Update Time for Turnstile Streaming Algorithms
- Timing-based mutual exclusion with local spinning. (Extended abstract)
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)
