The Causal Order is Strict

The causal order is central to many algorithms in both the message-passing and shared memory models. In the message-passing model, the causal order is clearly a strict, or irreflexive partial, order. However, some shared memory models are defined without reference to time. In those models, the causal order can fail to be a strict order. Existing works have either declared that all non-strict orders are not causal, or assumed that the causal order is strict without proof. We prove that, under a small number of reasonable assumptions about systems, the causal order is strict. In particular, we assume neither a global time model nor that processes issue a single shared memory operation at a time.

[1]  Ayru L. Oliveira Filhoy,et al.  A Graph-Theoretic Model of Shared-Memory Legality , 2000 .

[2]  Leslie Lamport,et al.  How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor , 1997, IEEE Trans. Computers.

[3]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.

[4]  A. K. Singh,et al.  On the validity of the global time assumption , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[5]  Gil Neiger,et al.  Causal memory: definitions, implementation, and programming , 1995, Distributed Computing.

[6]  Mustaque Ahamad,et al.  Implementing and programming causal distributed shared memory , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[7]  Paul G. Spirakis,et al.  Proceedings of the 5th International Workshop on Distributed Algorithms , 1991 .

[8]  Yair Amir,et al.  The Spread Wide Area Group Communication System , 2007 .

[9]  Robert Cori,et al.  A Note on Linearizability and the Global Time Axiom , 2003, Parallel Process. Lett..

[10]  Shai Ben-David,et al.  On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract) , 1991, WDAG.

[11]  Natarajan Shankar,et al.  Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS , 1995, IEEE Trans. Software Eng..

[12]  Supratik Mukhopadhyay,et al.  Service composition in a secure agent-based architecture , 2005, 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service.

[13]  鈴木 昭二,et al.  Reliable Distributed Systems , 1998 .

[14]  André Schiper,et al.  From Causal Consistency to Sequential Consistency in Shared Memory Systems , 1995, FSTTCS.

[15]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[16]  Leslie Lamport,et al.  The mutual exclusion problem: part I—a theory of interprocess communication , 1986, JACM.

[17]  D. M. Hutton,et al.  The Art of Multiprocessor Programming , 2008 .