A. D. Kshemkalyani and M. Singhal, "Necessary and sufficient conditions on information for causal message orderin and their optimal implementation", Distributed Computing 11: 91-111, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Exploiting Application Semantics in Communication Middleware - Singh (Correct)
....QoS parameters and ordering specification. The ordering specification is used to prescribe a set of possible sequences in which the channel may deliver the multicast messages. Many existing frameworks provide support for FIFO, causal and total ordering semantics [BvR94, MMSA 96, ADKM92, KS98] Application semantics has been exploited in group communication frameworks to improve performance [MG97, Sch88, JSM97, LLS90] For example, replicas of a database can be maintained consistent by delivering the operations to all replicas in the same order. However, in some cases, the ....
....i) deliver(m2; G; i) then deliver(m1; G; j) deliver(m2; G; j) Several efficient implementations of the FIFO, causal and total ordering semantics have been proposed. Proposals have been made to weaken the causal and total ordering semantics by taking application semantics into account [Sch88, KS98, JSM97, LLS90] In the following, we discuss some examples to motivate the need for additional application specific information: ffl In active replication, the replicas of an object form a group and all operations are broadcast in total order to the group [Sch90, SAA98, FG00] Consider an ....
A. Kshemkalyani and M. Singhal. Necessary and sufficient conditions on information for causal message ordering and their optimal implementation. Distributed Computing, April 1998.
Group Communication Specifications: A Comprehensive Study - Vitenberg, Keidar, al. (1999) (25 citations) (Correct)
....to multiple groups. In their approach, messages are pipelined through a sequence of groups. Such pipelining preserves the order semantics across groups as long as groups do not overlap. Unlike total order, virtually all group communication systems provide causally ordered multicast (cf. BSS91, KS98] that is, preserve the causality of messages sent in different groups. However, recently, Kalantar and Birman [KB99] have shown that causally ordered multicast is also costly. They show that such multicast leads to bursty behavior and to latencies three times longer than 8 The totally ordered ....
A. D. Kshemkalyani and M. Singhal. Necessary and sufficient conditions on information for causal message ordering and their optimal implementation. Distributed Computing, 11(2):91--111, April 1998.
An Efficient Algorithm for Causal Message Logging - Lee, Park, Yeom, Cho (1998) (1 citation) (Correct)
....the most accurate implementation costs up to N 2 words for each message with N processes in the system. Kshemkalyani and Singhal formulated necessary and sufficient conditions on the information for causal ordering whose space complexity is Omega Gamma N 2 ) and presented an optimal algorithm[8]. The size of this description may become a serious overhead in systems with thousands of processes. This paper presents an efficient logging algorithm, which requires no additional log description information. The proposed algorithm is based on the data structure, LogOn, in which the message logs ....
A. D. Kshemkalyani and M. Singhal. Necessary and sufficient conditions on information for causal message ordering and their optimal implementation. Distributed Computing, 11(2):91--111, 1998.
Performance of the Optimal Causal Multicast.. - Chandra, Gambhire.. (2004) Self-citation (Kshemkalyani) (Correct)
No context found.
A.D. Kshemkalyani and M. Singhal, "Necessary and Sufficient Conditions on Information for Causal Message Ordering and Their Optimal Implementation," Distributed Computing, vol. 11, no. 2, pp. 91-111, Apr. 1998.
An Adaptable Causal Message Ordering Protocol for Very.. - Saul Pomares Hernandez (2001) (Correct)
No context found.
A. D. Kshemkalyani and M. Singhal, "Necessary and sufficient conditions on information for causal message orderin and their optimal implementation", Distributed Computing 11: 91-111, 1998.
Lightweight Causal Cluster Consistency - Gidenstam, Koldehofe.. (2005) (Correct)
No context found.
A. D. Kshemkalyani and M. Singhal. Necessary and sufficient conditions on information for causal message ordering and their optimal implementation. Distributed Computing, 11:91--111, 1998.
Distributed Algorithms and Educational Simulation/Visualisation.. - Koldehofe (2005) (Correct)
No context found.
Kshemkalyani, A. D. and Singhal, M. 1998. Necessary and sufficient conditions on information for causal message ordering and their optimal implementation. Distributed Computing 11, 91--111.
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