Towards a real-time distributed computing model
From MaRDI portal
Publication:1004326
DOI10.1016/j.tcs.2008.10.012zbMath1160.68384MaRDI QIDQ1004326
Publication date: 2 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.012
lower bounds; distributed computing models; optimal clock synchronization; real-time scheduling analysis
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M14: Distributed systems
Related Items
Cites Work
- Unnamed Item
- Real time scheduling theory: A historical perspective
- Fault-tolerant distributed computing
- Liveness in timed and untimed systems
- A theory of timed automata
- Closed form bounds for clock synchronization under simple uncertainty assumptions
- Forward and backward simulations. I. Untimed Systems
- Time/contention trade-offs for multiprocessor synchronization
- Forward and backward simulations. II: Timing-based systems
- A theory of clock synchronization (extended abstract)
- An upper and lower bound for clock synchronization
- Time, clocks, and the ordering of events in a distributed system
- Shared-memory mutual exclusion: major research trends since 1986
- Distributed Computing - IWDC 2003
- Simulating synchronized clocks and common knowledge in distributed systems
- Optimal clock synchronization under different delay assumptions