Departmental Papers (CIS)

Date of this Version

September 1990

Document Type

Journal Article

Comments

Copyright 1990 IEEE. Reprinted from IEEE Transactions on Computers, Volume 39, Issue 9, September 1990.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Abstract

Two algorithms for timed synchronous communication between a single sender and single receiver have recently appeared in the literature. Each weakens the definition of "correct" timed synchronous communication in a different way, and exhibits a different "undesirable" behavior. In this paper, their performance is analyzed, and 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. We conclude by discussing the fault tolerance of the algorithms, and propose a mixed strategy that avoids some of the performance problems.

Keywords

ada rendezvous, distributed systems, performance analysis, predictability, real-time systems, synchronous communication

Share

COinS
 

Date Posted: 23 July 2008

This document has been peer reviewed.