Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
ACM Transactions on Programming Languages and Systems (TOPLAS)
Operating system concepts (2nd ed.)
Operating system concepts (2nd ed.)
Applications of Byzantine agreement in database systems
ACM Transactions on Database Systems (TODS)
Timing Issues in the Distributed Execution of Ada Programs
IEEE Transactions on Computers
Concepts and Notations for Concurrent Programming
ACM Computing Surveys (CSUR)
Real-Time Synchronization of Interprocess Communications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Abstraction Mechanisms and Language Design
Abstraction Mechanisms and Language Design
Byzantine clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A new fault-tolerant algorithm for clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Communication Support for Reliable Distributed Computing
Communication Support for Reliable Distributed Computing
Occam Programming Manual
A Performance Analysis of Timed Synchronous Communication Primitives
IEEE Transactions on Computers
Scheduling real-time transactions: a performance evaluation
ACM Transactions on Database Systems (TODS)
Use of Common Time Base for Checkpointing and Rollback Recovery in a Distributed System
IEEE Transactions on Software Engineering
Specification and Analysis of Real-Time Problem Solvers
IEEE Transactions on Software Engineering
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)
| Hi-index | 0.00 |
In distributed real-time systems, communicating processes cannot be delayed for arbitrary amounts of time while waiting for messages. Thus, communication primitives used for real-time programming usually allow the inclusion of a deadline or timeout to limit potential delays due to synchronization. This paper interprets timed synchronous communication as having absolute deadlines. Various ways of implementing deadlines are discussed, and two useful timed synchronous communication problems are identified which differ in the number of participating senders and receivers and type of synchronous communication. For each problem, a simple algorithm is presented and shown to be correct. The algorithms are shown to guarantee maximal success and to require the smallest delay intervals during which processes wait for synchronous communication. We also evaluate the number of messages used to reach agreement.