On real-time and non real-time distributed computing

DOI10.1007/BFB0022137MaRDI QIDQ6062514zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Towards a real-time distributed computing model
• Reconciling fault-tolerant distributed algorithms and real-time computing
• scientific article; zbMATH DE number 877850
• A hierarchy of domains for real-time distributed computing
• Exploring the Interplay between Computation and Communication in Distributed Real-Time Scheduling
• Task scheduling in distributed real-time systems
• Composition and distribution of resources for real-time computing systems

Cites work

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

Cited in

(2)

• Alternating real-time computations
• Constant space and non-constant time in distributed computing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062514)