Distributed Computing – IWDC 2005
7th International Workshop, Kharagpur, India, December 27-30, 2005. Proceedings
Page
%P
12 Result(s)
-
Book and Conference Proceedings
-
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...
-
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...
-
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...
-
Chapter and Conference Paper
A Simple, Memory-Efficient Bounded Concurrent Timestam** Algorithm
Several constructions have been proposed for implementing a Bounded Concurrent Timestamp System (BCTS). Some constructions are based on a recursively defined Precedence Graph. Such constructions have been viewed ...
-
Chapter and Conference Paper
Concurrent Knowledge and Logical Clock Abstractions
Vector and matrix clocks are exte sively used i asy chroous distributed systems.This paper asks,“how does the clock abstractio generalize?” and casts the problem in terms of concurrent knowledge. To this end, ...
-
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...
-
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...
-
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...
-
Chapter and Conference Paper
Significance and uses of fine-grained synchronization relations
In a distributed system, high-level actions can be modeled by nonatomic events. Synchronization relations between distributed nonatomic events have been proposed to allow applications a fine choice in specifyi...
-
Chapter and Conference Paper
Testing of synchronization conditions for distributed real-time applications
A set of synchronization relations between distributed nonatomic events was recently proposed to provide real-time applications with a fine level of discrimination in the specification of causality relations a...
-
Chapter and Conference Paper
A framework for viewing atomic events in distributed computations
We present a unifying framework for expressing and analyzing events at various levels of atomicity in distributed computations. In the framework, events at any level of atomicity are defined and composed in te...
