Timing Issues in the Distributed Execution of Ada Programs
IEEE Transactions on Computers
Adding time to synchronous process communications
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Occam Programming Manual
| Hi-index | 14.98 |
The performance of two algorithms for timed synchronous communication between a single sender and a single receiver is analyzed. Each weakens the definition of correct timed synchronous communication in a different way, and exhibits a different undesirable behavior. Their sensitivity to various parameters is discussed. These parameters include how long the processes are willing to wait for communication to be successful, how well synchronized the processes are, the assumed upper bound on message delay, and the actual end-to-end message delay distribution. The fault tolerance of the algorithms is discussed and a mixed strategy is proposed that avoids some of the performance problems.