47 search results - page 5 / 10 » podc 2010 |
162
click to vote
PODC
2010
ACM
15 years 6 months ago
2010
ACM
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
150
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
138
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
170
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
In this paper, we present a framework for achieving anonymity and trust, two seemingly contradictory properties, in distributed systems. Our approach builds on webs of trust, a we...
165
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...