Necessary and sufficient conditions on information for causal message ordering and their optimal implementation

Distributed Computing

Volumn 11, Issue 2, 1998, Pages 91-111

  Kshemkalyani, Ajay D ^a   Singhal, Mukesh ^b  

^a 705 Engineering Research Center   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Causal message ordering; Concurrency; Distributed systems; Synchronization

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONCURRENCY CONTROL; DATA COMMUNICATION SYSTEMS; ENCODING (SYMBOLS); SYNCHRONIZATION;

CAUSAL MESSAGE ORDERING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0032045376     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050044     Document Type: Article

References (26)

1. Alagar A, Venkatesan S: An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering, Inf Process Lett 50: 311-316 (1994)
2. Adelstein F, Singhal M: Real-Time Causal Message Ordering in Multimedia Systems, 15th IEEE Intl. Conf. on Distributed Computing Systems, pp 36-43, May 1995
3. Ahamad M, Hutto P, John R: Implementing and Programming Causal Distributed Memory. 11th IEEE Intl. Conf. on Distributed Computing Systems, pp 274-281, 1991
4. Birman K, Joseph T: Reliable Communication in Presence of Failures, ACM TOCS 5(1): 47-76 (1987)
5. Birman K, Schiper A, Stephenson P: Lightweight Causal and Atomic Group Multicast, ACM TOCS 9(3): 272-314 (1991)
6. Charron-Bost B, Tel G, Mattern F: Synchronous. Asynchronous, and Causally Ordered Communication. Distrib Comput 9(4): 173-191 (1996)
7. Fidge CA: Timestamps in Message-Passing Systems That Preserve Partial Ordering, Aust Comput Sci Commun 10(1): 56-66 (1988)
8. Joseph T, Birman K: Low Cost Management of Replicated Data in Fault-Tolerant Distributed Systems, ACM TOCS 4(1): 54-70 (1986)
9. Kim J, Kim C: An Efficient Causal Ordering Protocol in Group Communications, 10th Int. Conf. on Information Networking, pp 121-128, January 1996
10. Kshemkalyani A, Singhal M: Necessary and Sufficient Conditions on the Information for Causal Message Ordering and Their Optimal Implementation, TR29.2040. IBM, July 1995 (Also available as Tech. Report CTSRC-7/95-TR33, July 1995, The Ohio State University, ftp.cis.ohiostate.edu/pub/tech-report/1995/TR33.ps.gz.)
11. Kshemkalyani A, Singhal M: An Optimal Algorithm for Generalized Causal Message Ordering. 15th ACM Symp. on Principles of Distributed Computing, pp 87, May 1996
12. Kshemkalyani A: Temporal Interactions of Intervals in Distributed Systems, J Comput Syst Sci 52(2): 287-298 (1996)
13. Kshemkalyani A: Framework for Viewing Atomic Events in Distributed Computations, Theor Comput Sci 196(1-2): 45-70 (1998) (Abstract appears in Proc. EuroPar'96, L. Bouge, P. Fraigniaud, A. Mignotte, Y. Robert (eds.) LNCS 1123, pp 495-505, Berlin Heidelberg New York: Springer 1996)
14. Kshemkalyani A: Framework for Viewing Atomic Events in Distributed Computations, Theor Comput Sci 196(1-2): 45-70 (1998) (Abstract appears in Proc. EuroPar'96, L. Bouge, P. Fraigniaud, A. Mignotte, Y. Robert (eds.) LNCS 1123, pp 495-505, Berlin Heidelberg New York: Springer 1996)
15. Lamport L: Time, Clocks, and the Ordering of Events in a Distributed System, Communications of the ACM 21(7): 558-565 (1978)
16. Mattern F. Virtual Time and Global States of Distributed Systems, Parallel and Distributed Algorithms, pp 215-226, Amsterdam: North-Holland 1989
17. Mattern F, Fünfrocken S: A Nonlocking Lightweight Implementation of Causal Order Message Delivery, In: KP Birman, F Mattern, A Schiper (eds) Theory and Practice in Distributed Systems. LNCS 938, pp 197-213, Berlin Heidelberg New York: Springer 1995
18. Mostefaoui A, Raynal, M: Causal Multicasts in Overlapping Groups: Towards a Low Cost Approach, IEEE Workshop on Future Trends of Distributed Computer Systems, pp 136-142, September 1993
19. Peterson LL, Buchholz NC, Schlichting RD: Preserving and Using Context Information in Interprocess Communication, ACM TOCS 7: 217-246 (1989)
20. Ravindran K, Prasad B: Communication Structures and Paradigms for Distributed Conferencing Applications, 12th IEEE Int. Conf. on Distributed Computing Systems, May 1992
21. Raynal M, Schiper A, Toueg S: The Causal Ordering Abstraction and a Simple Way to Implement It, Inf Process Lett 39(6): 343-350 (1991)
22. Rodrigues L, Verissimo P: Causal Separators for Large-Scale Multicast Communication, 15th IEEE Int. Conf. on Distributed Computing Systems, pp 83-91, May 1995
23. Schiper A, Eggli J, Sandoz A: A New Algorithm to Implement Causal Ordering, In: J-C Bermond, M Raynal (eds) Proc. 3rd Int. Workshop on Distributed Algorithms, LNCS 392, pp 219-232, Berlin Heidelberg New York: Springer 1989
24. Schwarz R, Mattern F: Detecting Causal Relations in Distributed Computing: in Search of the Holy Grail, Distrib Comput 7(3): 149-174 (1994)
25. Singhal M, Kshemkalyani AD: An Efficient Implementation of Vector Clocks. Inf Process Lett 43: 47-53 (1992)
26. Wuu G, Bernstein A: Efficient Solutions to the Replicated Log and Dictionary Problems, 3rd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pp 233-242, Vancouver, Canada, August 1984