The process group approach to reliable distributed computing
Communications of the ACM
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Timely Computing Base Model and Architecture
IEEE Transactions on Computers
Approximate Real-Time Clocks for Scheduled Events
ISORC '02 Proceedings of the Fifth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Causally ordered delivery in a hierarchical group of peer processes
Computer Communications
| Hi-index | 0.00 |
In recent years there has been an increasing demand tobuild "soft" real-time applications on top of asynchronousdistributed systems. Designing and implementing such applicationsis a non-trivial task and applicationdesigners areoften faced with the need to circumvent impossibility results.In this paper we discuss how to ensure that actions are executedin the correct order even in the face of failures. Wepropose a novel time base and a new synchronization mechanismfor the design of distributed "soft" real-time applications.We demonstrate (1) how this time base can be usedto enforce an externally consistent ordering, and (2) howit permits to circumvent impossibility results by sketchinghow to solve the leader election and perfect failure detectionproblem.