Abstract
This paper focuses on two communication modes, namely Logically Instantaneity (li) and Causal Order (co). These communica- tion modes address two different levels of quality of service in message delivery. li means that it is possible to timestamp communication events with integers in such a way that (1) timestamps increase within each process and (2) the sending and the delivery events associated with each message have the same timestamp. So, there is a logical time frame in which for each message, the send event and the corresponding delivery events occur simultaneously. co means that when a process delivers a message m, its delivery occurs in a context where the receiving process knows all the causal past of m. Actually, Li is a property strictly stronger than co.
The paper explores these noteworthy communication modes. Their main interest lies in the fact that they deeply simplify the design of message- passing programs that are intended to run on distributed memory parallel machines or cluster of workstations.
Chapter PDF
Keywords
References
Ahuja M. and Raynal M., An implementation of Global Flush Primitives Using Counters. Parallel Processing Letters, Vol. 5(2):171–178, 1995.
Bagrodia R., Synchronization of Asynchronous Processes in CSP. ACM TOPLAS, 11(4):585–597, 1989.
Baldoni R., Prakash R., Raynal M. and Singhal M., Efficient Δ-Causal Broadcasting. Journal of Computer Systems Science and Engineering, 13(5):263–270, 1998.
Birman K.P. and Joseph T.A., Reliable Communication in the Presence of Failures. ACM TOCS, 5(1):47–76, 1987.
Bougé L., Repeated Snapshots in Distributed Systems with Synchronous Communications and their Implementation in CSP. TCS, 49:145–169, 1987.
Charron-Bost B., Mattern F. and Tel G., Synchronous, Asynchronous and Causally Ordered Communications. Distributed Computing, 9:173–191, 1996.
Hadzilacos V. and Toueg S., Reliable Broadcast and Related Problems. In Distributed Systems, acm Press (S. Mullender Ed.), New-York, pp. 97–145, 1993.
Hoare C.A.R., Communicating Sequential Processes. Communications of the ACM, 21(8):666–677, 1978.
Kshemkalyani A.D. and Singhal M., Necessary and Sufficient Conditions on Information for Causal Message Ordering and their Optimal Implementation. Distributed Computing, 11:91–111, 1998.
Lamport, L., Time, Clocks and the Ordering of Events in a Distributed System, Communications of the ACM, 21(7):558–565, 1978.
Murty V.V. and Garg V.K., Synchronous Message Passing. Tech. Report TR ECE-PDS-93-01, University of Texas at Austin, 1993.
Mostefaoui A., Raynal M. and Verissimo P., Logically Instantaneous Communications in Asynchronous Distributed Systems. 5th Int. Conference on Parallel Computing Technologies (PACT’99), St-Petersburg, Springer Verlag LNCS 1662, pp. 258–270, 1999.
Prakash R., Raynal M. and Singhal M., An adaptive Causal Ordering Algorithm Suited to Mobile Computing Environments. Journal of Parallel and Distributed Computing, 41:190–204, 1997.
Raynal M., Schiper A. and Toueg S., The Causal ordering Abstraction and a Simple Way to Implement it. Information Processing Letters, 39:343–351, 1991.
Soneoka T. and Ibaraki T., Logically Instantaneous Message Passing in Asynchronous Distributed Systems. IEEE TC, 43(5):513–527, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raynal, M. (2000). Logical Instantaneity and Causal Order: Two “First Class” Communication Modes for Parallel Computing. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_4
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive