This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Performance Analysis of Timed Synchronous Communication Primitives
September 1990 (vol. 39 no. 9)
pp. 1117-1131

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.

[1] U.S. Department of Defense, "Ada Programming Language," 1983. ANSI/MIL-STD-1815A-1983.
[2] INMOS Ltd.,Occam Programming Manual. Englewood Cliffs, NJ: Prentice-Hall Int., 1984.
[3] J. Gray, "Notes on database operation systems," inOperating Systems: An Advanced Course(Lecture Notes in Computer Science, vol. 60) Berlin: Springer-Verlag, 1978.
[4] I. Lee and S. Davidson, "Adding time to synchronous process communications,"IEEE Trans. Comput., pp. 941-948, Aug. 1987.
[5] R. A. Volz and R. N. Mudge, "Timing issues in the distributed execution of Ada programs,"IEEE Trans. Comput., vol. C-36, pp. 449-459, Apr. 1987.
[6] K. Lin, S. Natarajan, and J. Liu, "Imprecise results: Utilizing partial computations in real-time systems," inProc. Real-Time Syst. Symp., Dec. 1987, pp. 210-217.
[7] S. Davidson and A. Watters, "Partial computation in real-time database systems," inWorkshop Real-Time Oper. Syst., May 1988.
[8] I. Lee and V. Gehlot, "Language constructs for distributed real-time programming," inProc. IEEE Real-Time Syst. Symp., Dec. 1985.
[9] J. W. Wong, "Distribution of end-to-end delay in message-switched networks,"Comput. Networks, vol. 2, pp. 44-49, 1978.
[10] I. Lee, S. B. Davidson, and V. Wolfe, "Motivating time as a first class entity," Tech. Rep. MS-CIS-87-54, Dep. Comput. Inform. Sci., Univ. of Pennsylvania, 1987.

Index Terms:
performance analysis; synchronous communication primitives; timed synchronous communication; fault tolerance; mixed strategy; algorithm theory; performance evaluation.
Citation:
I. Lee, S.B. Davidson, "A Performance Analysis of Timed Synchronous Communication Primitives," IEEE Transactions on Computers, vol. 39, no. 9, pp. 1117-1131, Sept. 1990, doi:10.1109/12.57054
Usage of this product signifies your acceptance of the Terms of Use.