Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Scheduling Tasks with Resource Requirements in Hard Real-Time Systems
IEEE Transactions on Software Engineering
Preemptive scheduling under time and resource constraints
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Statically Safe Speculative Execution for Real-Time Systems
IEEE Transactions on Software Engineering
Designing Adaptable Real-Time Fault-Tolerant Parallel Systems
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Real-time dependable decisions in timed asynchronous distributed systems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Distributed real time database systems: background and literature review
Distributed and Parallel Databases
Implementing real-time transactional security property using timed edit automata
Proceedings of the 6th International Conference on Security of Information and Networks
| Hi-index | 14.98 |
Timed atomic commitment is defined, protocols to implement it in a realistic operating environment are devised, and its usefulness is shown through an example. In a large class of hard-real-time control applications, components execute concurrently on distributed nodes and must coordinate, under timing constraints, to perform the control task. As such, they perform a type of atomic commitment. Traditional atomic commitment differs, however, because there are no timing constraints; agreement is eventual. The authors define timed atomic commitment (TAC), which requires the processes to be functionally consistent, but allows the outcome to include an exceptional state, indicating that timing constraints have been violated. Centralized and decentralized protocols to implement TAC are presented. Programming constructs for TAC are introduced, and their use is illustrated in a coordinating robots example.