Complexity of network synchronization
Journal of the ACM (JACM)
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
Distributed Algorithms
Reliable Distributed Computing with the ISIS Toolkit
Reliable Distributed Computing with the ISIS Toolkit
Proof-Based System Engineering and Embedded Systems
Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
We present here algorithms for Real-Time Fault-Tolerance Uniform Atomic Broadcast. We first design a distributed execution model for asynchronous systems with crash failure (called Synchronized Phase System (SPS)), then we give an algorithm for Atomic Broadcast in SPS. In a SPS, the processes try to run in synchronized rounds like in synchronous systems.SPSs can be implemented in asynchronous systems, but the liveness properties follow the properties of the knowledge of processes concerning the failures of other processes. In timed partially synchronous systems, we can give explicitly Feasibility Conditions to solve Real-Time Uniform Atomic Broadcast. At present, these algorithms are being implemented in the French project ATR.