Reconciling fault-tolerant distributed algorithms and real-time computing

DOI10.1007/s00446-013-0204-1zbMath1291.68054OpenAlexW1995724421WikidataQ39852293 ScholiaQ39852293MaRDI QIDQ2251157

Ulrich Schmid, Heinrich Moser

Publication date: 11 July 2014

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-013-0204-1

zbMATH Keywords

fault-tolerancereal-time analysisdistributed computing modelsproof techniques

Mathematics Subject Classification ID

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

Related Items

Reconciling fault-tolerant distributed algorithms and real-time computing

Uses Software

• Kronos
• Uppaal

Cites Work

• Unnamed Item
• Real time scheduling theory: A historical perspective
• Synchronous consensus under hybrid process and link failures
• Towards a real-time distributed computing model
• Liveness in timed and untimed systems
• Uppaal in a nutshell
• Forward and backward simulations. I. Untimed Systems
• Time/contention trade-offs for multiprocessor synchronization
• Forward and backward simulations. II: Timing-based systems
• Booting clock synchronization in partially synchronous systems with hybrid process and link failures
• Reconciling fault-tolerant distributed algorithms and real-time computing
• An upper and lower bound for clock synchronization
• The Byzantine Generals Problem
• Time, clocks, and the ordering of events in a distributed system
• Shared-memory mutual exclusion: major research trends since 1986
• Simulating synchronized clocks and common knowledge in distributed systems

This page was built for publication: Reconciling fault-tolerant distributed algorithms and real-time computing