Abstract
The objective of this paper is to introduce a model for causal delivery protocols in real-time systems. We start by showing that temporal order properties of real-time protocols are independent of whether they are timer-driven or clock-driven, being instead related to their degree of synchronism, that we call steadiness. Then, we derive a set of correctness conditions for such protocols to secure causal delivery order. To achieve this objective, we use an extension of Lamport's model of time-stamp based order. We show that both timer- and clock-driven protocols have order correctness limits dictated by the environment and the target applications, and define those limits, through a set of working formulas. We show that in extremely adverse cases, timer-driven protocols will perform as well as clock-driven ones, due to the restrictions imposed on the operation of the latter, which is perhaps surprising. These results open the door to exploring new forms of communication in time-critical systems, for example, supporting clock-and time-driven communication, and event-and time-triggered operation. We expect that the results of this paper will give insight to that problem, and will be useful in real-life systems, such as distributed computer control.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amir, Yair, Dolev, Danny, Kramer, Shlomo, and Malki, Dalia. 1992. Transis: A communication sub-system for high-availability. Digest of Papers, The 22nd International Symposium on Fault-Tolerant Computing Systems, IEEE, pp. 76–84.
Birman, K., and Joseph, T. 1987. Reliable communication in the presence of failures. ACM, Transactions on Computer Systems 5(1).
Birman, Kenneth, Schiper, Andre, and Stephenson, Pat. 1991. Lightweight causal and atomic group multicast. ACM Transactions on Computer Systems 9(3).
Cristian, F., Aghili, H., Strong, R., and Dolev, D. 1985. Atomic broadcast: from simple message diffusion to Byzantine agreement. Digest of Papers, The 15th International Symposium on Fault-Tolerant Computing, Ann Arbor-USA. IEEE.
Kopetz, H. 1992. Sparse time versus dense time in distributed systems. Proceedings of the 12th International Conference on Distributed Computing Systems, Yokohama, Tokyo. IEEE.
Kopetz, H., and G. Grunsteidl. TTP—a time-triggered protocol for fault-tolerant real-time systems. Digest of Papers, The 23th International Symposium on Fault-Tolerant Computing, Toulouse, France, pp. 524–533. IEEE.
Kopetz, Hermann, and Kim, K. H. (Kane). 1990. Temporal uncertainties in interactions among real-time objects. Proceedings of the Ninth Symposium on Reliable Distributed Systems, Huntsville, Alabama, pp. 165–174. IEEE.
KopetzHermann, and OchsenreiterWilhelm. 1987. Clock syncronization in distributed real-time systems. IEEE Transactions on Computers C-36(8): 933–940.
Kopetz, Hermann, and Veríssimo, Paulo. 1993. Real-time and dependability concepts. In Distributed Systems, 2nd Edition, S. J. Mullender, editor, ACM-Press, pp. 411–446. Addison-Wesley.
Lamport, Leslie. 1978. Time, clocks and the ordering of events in a distributed system. CACM 7(21).
Melliar-Smith, P.M., and Moser, L.E. 1989. Fault-tolerant distributed systems based on broadcast communication. Proceedings of the 9th Internacional Conference on Distributed Computing systems, IEEE, pp. 129–133.
Peterson, Larry L., Buchholz, Nick C., and Schlichting, Richard D. 1989. Preserving and using context information in interprocess communication. ACM Transactions on Computer Systems 7(3).
Rodrigues, L., and Veríssimo, P. 1992. xAMp: a multi-primitive group communications service. Proceedings of the 11th Symposium on Reliable Distributed Systems, Houston, Texas, pp. 112–121. INESC AR/66-92.
SchiperA., EggliJ., and SandozA. 1989. A new algorithm to implement causal ordering. Proceedings of the 3rd Int Workshop on Distributed Algorithms, volume LNCS 392, Nice, France, pp. 219–232. Springer Verlag.
SchneiderFred B. 1987. Understanding protocols for Byzantine clock synchronization. Technical report, Cornell University, Ithaca, New York.
VeríssimoP. 1994. Ordering and timeliness requirements of dependable real-time programs. Real-Time Systems 7(2): 105–128. Also as INESC AR/14-94.
Veríssimo, P., and Rodrigues, L. 1992. A posteriori agreement for fault-tolerant clock synchronization on broadcast networks. Digest of Papers, The 22th International Symposium on Fault-Tolerant Computing, Boston. INESC AR/65-92.
VeríssimoP., RufinoJ., FonsecaH., and RodriguesL. 1991. The performance of the xAMp protocol on token-bus and fddi nac's. Technical Report RT/109-91, INESC, Lisboa, Portugal.
Veríssimo, Paulo. 1990. Real-time data management with clock-less reliable broadcast protocols. Proceedings of the Workshop on the Management of Replicated Data, Houston, Texas, Also as INESC AR/25-90.
Veríssimo, Paulo. 1993. Real-time communication. In Distributed Systems, 2nd Edition, S. J. Mullender, editor, ACM-Press, pp. 447–490. Addison-Wesley.
Veríssimo, Paulo, Barrett, P., Bond, P., Hilborne, A., Rodrigues, L., and Seaton, D. 1991. The extra performance architecture (XPA). In Delta-4—A Generic Architecture for Dependable Distributed Computing, D. Powell, editor, ESPRIT Research Reports, pp. 211–266. Springer Verlag.
Veríssimo, Paulo, Rodrigues, L., and Rufino, J. 1991. The atomic multicast protocol (AMp). In Delta-4—A Generic Architecture for Dependable Distributed Computing, D. Powell, editor, ESPRIT Research Reports, pp. 267–294. Springer Verlag.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Veríssimo, P. Causal delivery protocols in real-time systems: A generic model. Real Time Systems 10, 45–73 (1996). https://doi.org/10.1007/BF00357883
Issue Date:
DOI: https://doi.org/10.1007/BF00357883