DC
2010
12 years 11 months ago
2010
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
DC
2010
13 years 1 months ago
2010
In this paper, we present RAMBO, an algorithm for emulating a read/write distributed shared memory in a dynamic, rapidly changing environment. RAMBO provides a highly reliable, hi...
DC
2010
13 years 1 months ago
2010
In this paper, we comparatively analyze some mainstream calculi for mobility and distribution, together with some of their variants: asynchronous -calculus, distributed -calculus,...
DC
2010
13 years 4 months ago
2010
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
DC
2010
13 years 4 months ago
2010
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
DC
2010
13 years 4 months ago
2010
DC
2010
13 years 4 months ago
2010
We introduce a simple liveness property for shared object implementations that is gracefully degrading depending on the degree of synchrony in each run. This property, called adapt...
DC
2010
13 years 4 months ago
2010
DC
2010
13 years 4 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
DC
2010
13 years 4 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...