Mutual exclusion and coucurreucy are two fuudameutal and essentially opposite features in distributed systems. However , in some applications such as computer supported cooperative works (CSCW) we have found it necessary to impose mutual exclusion on different groups of processes in access-ing a resource, while allowing processes of the same group to share… (More)
The design issues for asynchronous group mutual exclusion have been modeled as the Congenial Talking Philosophers, and solutions for shared-memory models have been proposed 4]. This paper presents an eecient and highly concurrent distributed algorithm for computer networks where processes communicate by message passing.
Mutual exclusion and concurrency are two fundamental and essentially opposite features in distributed systems. However , in some applications such as computer supported cooperative works (CSCW) we have found it necessary to impose mutual exclusion on diierent groups of processes in accessing a resource, while allowing processes of the same group to share… (More)
The design issues for group mutual exclusion have been modeled by Joung as the Congenial Talking Philosophers , and solutions for shared-memory models and complete message-passing networks have been proposed [2, 3]. These solutions, however, cannot be straightforwardly and efficiently converted to ring networks where each philosopher can only communicate… (More)
We present Multi, a symmetric, fully distributed, randomized algorithm that, with probability 1, schedules multiparty interactions in a strongly fair manner. To our knowledge, Multi is the rst algorithm for strong interaction fairness to appear in the literature. Moreover , the expected time taken by Multi to establish an interaction is a constant not… (More)
We propose a simple, practical, yet powerful index scheme to enhance search in unstructured P2P networks. The index scheme uses a data structure "Bloom Filters" to index files shared at each node, and then let nodes gossip to one another to exchange their Bloom filters. In effect, each node indexes a random set of files in the network, thereby allowing… (More)
This is the first part of a two-part paper in which we discuss the implementability of fairness notions in distributed systems where asynchronous processes interact via synchronous constructs—usually called multiparty interactions. In this part we present a criterion for fairness notions and show that if a fairness notion violates the criterion, then no… (More)
Existing techniques for keyword/attribute search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unable to facilitate ranking. In this paper, we present a general keyword index and search scheme for structured P2P networks that avoids these problems, and in which object insert,… (More)
We present a taxonomy of languages for multiparty interaction, which covers all proposals of which we are aware. Based on this taxonomy, we present a comprehensive analysis of the computational complexity of the <italic>multiparty interaction implementation problem</italic>, the problem of scheduling multiparty interactions in a given execution environment.