A.D. Kshemkalyani and M. Singhal. An optimal algorithm for generalized causal message ordering. In PODC '96: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, page 87. ACM Press, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Lightweight Algorithm for Causal Message Ordering in.. - Skawratananond, al. (1998) (4 citations) (Correct)
.... such as management of replicated data [8, 9] distributed monitoring [6] resource allocation [18] distributed shared memory [3] multimedia systems [2] and collaborative work [19] The protocols to implement causal message ordering in systems with static hosts have been presented in [14, 9, 16, 18, 20, 21]. These protocols can be executed by every mobile host with all the relevant data structures being stored on the mobile hosts themselves. However, considering limited resources and bandwidth of wireless links available to mobile hosts, it is not appropriate to apply these protocols directly to ....
A.D. Kshemkalyani and M. Singhal. An Optimal Algorithm for Generalized Causal Message Ordering. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 87-88, Philadelphia, Pennsylvania, May 1996.
A Lightweight Algorithm for Causal Message Ordering in .. - Skawratananond.. (1998) (4 citations) (Correct)
.... such as management of replicated data [8, 9] distributed monitoring [6] resource allocation [18] distributed shared memory [3] multimedia systems [2] and collaborative work [19] The protocols to implement causal message ordering in systems with static hosts have been presented in [14, 9, 16, 18, 20, 21]. These protocols can be executed by every mobile host with all the relevant data structures being stored on the mobile hosts themselves. However, considering limited resources and bandwidth of wireless links available to mobile hosts, it is not appropriate to apply these protocols directly to ....
A.D. Kshemkalyani and M. Singhal. An Optimal Algorithm for Generalized Causal Message Ordering. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 87--88, Philadephia, Pennsylvania, May 1996.
A Lightweight Algorithm for Causal Message Ordering in .. - Skawratananond.. (1998) (4 citations) (Correct)
.... such as management of replicated data [5, 6] distributed monitoring [4] resource allocation [11] distributed shared memory [2] multimedia systems [1] and collaborative work [12] The protocols to implement causal message ordering in systems with static hosts have been presented in [7, 6, 9, 11, 13, 14]. These protocols can be executed by every mobile host with all the relevant data structures being stored on the mobile hosts themselves. However, considering limited resources and bandwidth of wireless links available to mobile hosts, it is not appropriate to apply these protocols directly to ....
A.D. Kshemkalyani and M. Singhal. An Optimal Algorithm for Generalized Causal Message Ordering. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 87--88, Philadephia, Pennsylvania, May 1996.
Global Causal Ordering with Minimal Latency - Koch, Moser, Melliar-Smith (Correct)
....an overhead that grows not only with the network size but also with the amount of network traffic. The algorithm of Raynal, Schiper and Toueg [4] is more static. Their algorithm attaches an N Theta N matrix to each message, where N is the number of nodes in the network. Kshemkalyani and Singhal [5, 6] propose an algorithm that dispenses with the matrix and uses a vector instead, as do later versions of Isis [7] Mostefaoui and Raynal [8] reduce the message overhead further, while accepting additional message delay. They use a single scalar timestamp per group. The timestamp is derived from a ....
A. D. Kshemkalyani and M. Singhal, "An optimal algorithm for generalized causal message ordering," Proceedings of the 15th Annual (ACM) Symposium on Principles of Distributed Computing, Philadelphia, PA (May 1996), pp. 87.
Synchronization in Massive Multiplayer - Online Games Stefano (Correct)
No context found.
A.D. Kshemkalyani and M. Singhal. An optimal algorithm for generalized causal message ordering. In PODC '96: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, page 87. ACM Press, 1996.
An Adaptable Causal Message Ordering Protocol for Very.. - Saul Pomares Hernandez (2001) (Correct)
No context found.
A. d. Kshemkalyani et M. Singhal, "An Optimal Algorithm for Generalized Causal Message Ordering", In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC '96), pp. 8787, ACM, May 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC