On real-time and non real-time distributed computing

DOI10.1007/BFB0022137zbMath1524.68146OpenAlexW2122004010MaRDI QIDQ6062514

Gerard le Lann

Publication date: 1 December 2023

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

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• On the impossibility of group membership
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• The Byzantine Generals Problem
• Unreliable failure detectors for asynchronous systems (preliminary version)
• The weakest failure detector for solving consensus
• Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: On real-time and non real-time distributed computing