Dissecting distributed coordination
From MaRDI portal
Publication:6062520
DOI10.1007/bfb0022141zbMath1524.68031MaRDI QIDQ6062520
Publication date: 1 December 2023
Published in: Distributed Algorithms (Search for Journal in Brave)
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- How processes learn
- Knowledge and common knowledge in a distributed environment
- Impossibility of distributed consensus with one faulty process
- The Byzantine Generals Problem
- Time, clocks, and the ordering of events in a distributed system
- Using process groups to implement failure detection in asynchronous environments
- The weakest failure detector for solving consensus
- Uniform actions in asynchronous distributed systems
This page was built for publication: Dissecting distributed coordination