Learn More
Group mutual exclusion occurs naturally in situations where a resource can be shared by processes of the same group, but not by processes of different groups. For example, suppose data is stored in a CD-jukebox. Then when a disc is loaded for access, users that need data on the disc can concurrently access the disc, while users that need data on a different(More)
Abstract. Mutual exclusion and concurrency are two fundamental and essentially opposite features in distributed systems. However, in some applications such as Computer Supported Cooperative Work (CSCW) we have found it necessary to impose mutual exclusion on different groups of processes in accessing a resource, while allowing processes of the same group(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 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)