The Community for Technology Leaders
Green Image
<p>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.</p>
performance analysis; synchronous communication primitives; timed synchronous communication; fault tolerance; mixed strategy; algorithm theory; performance evaluation.

S. Davidson and I. Lee, "A Performance Analysis of Timed Synchronous Communication Primitives," in IEEE Transactions on Computers, vol. 39, no. , pp. 1117-1131, 1990.
93 ms
(Ver 3.3 (11022016))