Logical Instantaneity and Causal Order: Two ``First Class'' Communication Modes for Parallel Computing

Authors:
Michel Raynal
Affiliations:
-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 12
Cited 0

Reliable communication in the presence of failures

ACM Transactions on Computer Systems (TOCS)
Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP

Theoretical Computer Science
Synchronization of asynchronous processes in CSP

ACM Transactions on Programming Languages and Systems (TOPLAS)
The causal ordering abstraction and a simple way to implement it

Information Processing Letters
An adaptive causal ordering algorithm suited to mobile computing environments

Journal of Parallel and Distributed Computing
Fault-tolerant broadcasts and related problems

Distributed systems (2nd Ed.)
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Communicating sequential processes

Communications of the ACM
Logically Instantaneous Message Passing in Asynchronous Distributed Systems

IEEE Transactions on Computers
Logically Instantaneous Communication on Top of Distributed Memory Parallel Machines

PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Necessary and sufficient conditions on information for causal message ordering and their optimal implementation

Distributed Computing
Synchronous, asynchronous, and causally ordered communication

Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on two communication modes, namely Logically Instantaneity (LI) and Causal Order (CO). These communication 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.