Reducing false causality in causal message ordering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1970, Issue , 2000, Pages 61-72

  Gambhire, Pranav ^a   Kshemkalyani, Ajay D ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CAUSAL RELATIONSHIPS; HAPPENS-BEFORE; MESSAGE DELIVERY; MESSAGE ORDERING;

ALGORITHMS;

EID: 84947603834     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44467-x_6     Document Type: Article

References (17)

1. nd International Symposium on Fault-tolerant Computing, IEEE Computer Society Press, 337-346, 1991
2. K. Birman, A response to Cheriton and Skeen’s criticism of causal and totally ordered communication, Operating Systems Review, 28(1): 11-21, Jan. 1994
3. K. Birman, T. Joseph, Reliable communication in the presence of failures, ACM Transactions on Computer Systems, 5(1): 47-76, Feb. 1987
4. K. Birman, A. Schiper and P. Stephenson, Lightweight causal and atomic group multicast, ACM Transactions on Computer Systems, 9(3): 272-314, Aug. 1991
5. J. Caroll, A. Borshchev, A deterministic model of time for distributed systems, Proc. Eighth IEEE Symposium on Parallel and Distributed Processing, 593-598, Oct. 1996
6. th ACM Symposium on the Operating Systems Principles, 44-57, Dec. 1993
7. C. Fidge, Logical time in distributed computing systems, IEEE Computer, 24(8): 28-33, Aug. 1991
8. P. Gambhire, Efficient Causal Message Ordering, M.S. Thesis, University of Illinois at Chicago, April 2000
9. F. Kaashoek, A. Tanenbaum, Group communication in the Ameoba distributed operating system, Proc. Fifth ACM Annual Symposium on Principles of Distributed, Computing, 125-136, 1986
10. A. Kshemkalyani, M. Singhal, Necessary and sufficient conditions on information for causal message ordering and their optimal implementation, Distributed Computing, 11(2), 91-111, April 1998
11. L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, 21(7): 558-565, July 1978
12. L.L. Peterson, N.C. Bucholz and R.D. Schlichting, Preserving and using context information in interprocess communication, ACM Transactions on Computer Systems 7(3), 217-246, 1989
13. M. Raynal, A. Schiper, S. Toueg, The causal ordering abstraction and a simple way to implement it, Information Processing Letters 39: 343-350, 1991
14. th IEEE International Conf. on Distributed Computing Systems, May 1995
15. R. Van Renesse, Causal controversy at Le Mont St. Michel, Operating Systems Review, 27(2): 44-53, April 1993
16. A. Schiper, A. Eggli, A. Sandoz, A new algorithm to implement causal ordering, Proc. Third International Workshop on Distributed Systems, Nice, France, LNCS 392, Springer-Verlag, 219-232, 1989
17. th IEEE International Conf. on Distributed Computing Systems, 94-101, May 1998