Punit Chandra, Pranav Gambhire, Ajay D. Kshemkalyani  Home/Search
Context
Related
| uic.edu/~ajayk/int/../ex...tpds0104.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: uic.edu/~ajayk/int/students (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An optimal causal message ordering algorithm for asynchronous distributed systems was proposed by Kshemkalyani and Singhal and its optimality was proven theoretically. For a system of n processes, although the space complexity of this algorithm was shown to be On integers, it was expected that the actual space overhead would be much less than n . It is difficult to determine the behavior of this algorithm by a theoretical analysis. In this paper, we measure the overheads of two... (Update)
Active bibliography (related documents): More All
0.1: Lightweight Causal Cluster Consistency - Gidenstam, Koldehofe.. (2005) (Correct)
0.1: Distributed Algorithms and Educational Simulation/Visualisation.. - Koldehofe (2005) (Correct)
0.1: Group Communication Specifications: A Comprehensive Study - Vitenberg, Keidar, al. (1999) (Correct)
Similar documents based on text: More All
0.3: Necessary and Sufficient Conditions on Information for.. - Kshemkalyani, Singhal (1998) (Correct)
0.3: An Optimal Algorithm for Generalized Causal Message Ordering - Kshemkalyani, Singhal (1996) (Correct)
0.3: Global Predicate Detection under Fine-Grained Modalities - Chandra, Kshemkalyani (2003) (Correct)
BibTeX entry: (Update)
@misc{ chandra-performance,
author = "Punit Chandra and Pranav Gambhire and Ajay D. Kshemkalyani",
title = "Performance of the Optimal Causal Multicast Algorithm: A Statistical Analysis",
url = "citeseer.ist.psu.edu/chandra04performance.html" }
Citations (may not include all citations):470 Lightweight Causal and Atomic Group Multicast (context) - Birman, Schiper et al. - 1991
361 Reliable Communication in the Presence of Failures (context) - Birman, Joseph - 1987
352 Time, Clocks, and the Ordering of Events in a Distributed Sy.. (context) - Lamport - 1978
310 Transis: A Communication Sub-System for High-Availability - Amir, Dolev et al. - 1991
214 Preserving and Using Context Information in Interprocess Com.. - Peterson, Bucholz et al. - 1989
133 Newtop: A Fault-Tolerant Group Communication Protocol - Ezhilchelvan, Macedo et al. - 1995
83 The Causal Ordering Abstraction and a Simple Way to Implemen.. (context) - Raynal, Schiper et al. - 1991
53 Difficulties in Simulating the Internet - Floyd, Paxson - 2001
51 A New Algorithm to Implement Causal Ordering (context) - Schiper, Eggli et al. - 1989
7 Necessary and Sufficient Conditions on Information for Causa.. - Kshemkalyani, Singhal - 1998
1 Group Communication in the Ameoba Distributed Operating Syst.. (context) - Kaashoek, Tanenbaum - 1986
1 Evaluation of the Optimal Causal Message Ordering Algorithm (context) - Gambhire, Kshemkalyani - 2000
Documents on the same site (http://www.cs.uic.edu/~ajayk/int/students.html): More
A Simple, Memory-Efficient Bounded Concurrent.. - Shikaripura, Kshemkalyani (Correct)
SWIFT: Scheduling in Web Servers for Fast Response Time - Mayank Rawat And (2003) (Correct)
Global Predicate Detection under Fine-Grained Modalities - Chandra, Kshemkalyani (2003) (Correct)
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