Time-Adaptive Algorithms for Synchronization
From MaRDI portal
Recommendations
Cited in
(19)- Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory
- Stabilizing time-adaptive protocols
- Time bounds for real-time process control in the presence of timing uncertainty
- A visit to mutual exclusion in seven dates
- Solo-valency and the cost of coordination
- Time-adaptive algorithms for synchronization
- Time bounds on synchronization in a periodic distributed system
- The Synchronization Power of Coalesced Memory Accesses
- Axioms for memory access in asynchronous hardware systems
- scientific article; zbMATH DE number 4050992 (Why is no real title available?)
- scientific article; zbMATH DE number 1351080 (Why is no real title available?)
- Bounded Concurrent Time-Stamping
- The Impact of Timing Knowledge on the Session Problem
- Fast timing-based algorithms
- Hundreds of impossibility results for distributed computing
- Randomized protocols for asynchronous consensus
- Time bounds for decision problems in the presence of timing uncertainty and failures
- Light-weight leases for storage-centric coordination
- Algorithm of simulation time synchronization over large-scale nodes
This page was built for publication: Time-Adaptive Algorithms for Synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337652)
