A new algorithm to implement causal ordering-Reference-Cited by-同舟云学术

A new algorithm to implement causal ordering

Published:1989 Issue: Volume: Page:219-232
ISSN:0302-9743
Container-title:Distributed Algorithms
language:
Short-container-title:

Author:

Schiper André,Eggli Jorge,Sandoz Alain

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-51687-5_45.pdf

Reference9 articles.

1. K. Birman, T. Joseph, "Reliable Communications in Presence of Failures", ACM Trans. on Computer Systems, Vol 5, No 1 (Feb 1987), pp 47–76.

2. K.Birman et al., "ISIS — A Distributed Programming Environment", Cornell University, June 1988.

3. K.Birman, "Exploiting Replication", in Lectures Notes Arctic'88, Tromso, July 1988.

4. C.Fidge, "Timestamps in Message-Passing Systems That Preserve the Partial Ordering", Proc. of the 11th Australian Computer Science Conference, Univ of Queensland, Feb 1988.

5. T. Joseph, K. Birman, "Low Cost Management of Replicated Data in Fault-Tolerant Distributed Systems", ACM Trans. on Computer Systems, Vol 4, No 1 (Feb 1986), pp54–70.

Cited by 44 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Byzantine-Tolerant Causal Ordering for Unicasts, Multicasts, and Broadcasts;IEEE Transactions on Parallel and Distributed Systems;2024-05

2. Inductive Diagrams for Causal Reasoning;Proceedings of the ACM on Programming Languages;2024-04-29

3. Clock Synchronization and Event Ordering;Distributed Systems;2023-02-10

4. A Partial Order View of Message-Passing Communication Models;Proceedings of the ACM on Programming Languages;2023-01-09

5. Causal Ordering in the Presence of Byzantine Processes;2022 IEEE 28th International Conference on Parallel and Distributed Systems (ICPADS);2023-01