Skip to main content

7 Result(s)

within Ajay D. Kshemkalyani Remove this filter Computer Science Remove this filter Computer Communication Networks Remove this filter Theory of Computation Remove this filter

and

  1. No Access

    Book and Conference Proceedings

    Distributed Computing – IWDC 2005

    7th International Workshop, Kharagpur, India, December 27-30, 2005. Proceedings

    Ajit Pal, Ajay D. Kshemkalyani… in Lecture Notes in Computer Science (2005)

  2. No Access

    Chapter and Conference Paper

    Performance of Fair Distributed Mutual Exclusion Algorithms

    The classical Ricart-Agrawala algorithm (RA) has long been considered the most efficient fair mutual exclusion algorithm in distributed message-passing systems. The algorithm requires 2(N – 1) messages per critic...

    Kandarp Jani, Ajay D. Kshemkalyani in Distributed Computing - IWDC 2004 (2005)

  3. No Access

    Article

    The power of logical clock abstractions

    Vector and matrix clocks are extensively used in asynchronous distributed systems. This paper asks, “how does the clock abstraction generalize?” To address this problem, the paper motivates and proposes logica...

    Ajay D. Kshemkalyani in Distributed Computing (2004)

  4. No Access

    Chapter and Conference Paper

    A Note on Modalities for Nonconjunctive Global Predicates

    Global predicate detection is an important problem in distributed executions. A conjunctive predicate is one in which each conjunct is defined over variables local to a single process. Polynomial space and tim...

    Ajay D. Kshemkalyani in Distributed Computing - IWDC 2003 (2003)

  5. Chapter and Conference Paper

    Universal Constructs in Distributed Computations

    This paper identifies two classes of communication patterns that occur in distributed computations and explores their properties. It first examines local patterns, primarily IO and OI intervals, that occur at nod...

    Ajay D. Kshemkalyani, Mukesh Singhal in Euro-Par’99 Parallel Processing (1999)

    Download PDF (170 KB)

  6. No Access

    Article

    Causality and atomicity in distributed computations

    In a distributed system, high-level actions can be modeled by nonatomic events. This paper proposes causality relations between distributed nonatomic events and provides efficient testing conditions for the r...

    Ajay D. Kshemkalyani in Distributed Computing (1998)

  7. No Access

    Article

    Necessary and sufficient conditions on information for causal message ordering and their optimal implementation

    This paper formulates necessary and sufficient conditions on the information required for enforcing causal ordering in a distributed system with asynchronous communication. The paper then presents an algorith...

    Ajay D. Kshemkalyani, Mukesh Singhal in Distributed Computing (1998)