Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
The PROMPT Real-Time Commit Protocol
IEEE Transactions on Parallel and Distributed Systems
ACM Transactions on Computer Systems (TOCS)
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A Uniform Reliable Multicast Protocol with Guaranteed Response Times
LCTES '98 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
A Methodology for Designing and Dimensioning Critical Complex Computing Systems
ECBS '96 Proceedings of the IEEE Symposium and Workshop on Engineering of Computer Based Systems
A FIFO worst case analysis for a hard real-time distributed problem with consistency constraints
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
On new scheduling policy for the improvement of firm RTDBSs performances
Data & Knowledge Engineering
| Hi-index | 0.00 |
In this paper, we study the problem of maintaining the consistency of distributed objects in real-time. Sporadic transactions sent by a set of clients must be processed by a set servers with a bounded end-to-end response time. We propose in this article a solution, following the state machine approach, based on a particular non-preemptive scheduling denoted EDF* (Earliest Deadline First *). The scheduling on the servers is based on timestamps set by the clients and on an end-to-end deadline to respect. The clock of clients and servers are ε synchronized. We establish in this article the feasibility conditions of the distributed real-time system that permits to grant the consistency of distributed objects and the respect of end-to-end deadlines associated to transactions in charge of read/write access to the objects.