Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
DC
2010
11 years 6 months ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
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...
Robert Danek, Wojciech M. Golab
DC
2010
11 years 8 months ago
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
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...
Seth Gilbert, Nancy A. Lynch, Alexander A. Shvarts...
DC
2010
11 years 9 months ago
A taxonomy of process calculi for distribution and mobility
In this paper, we comparatively analyze some mainstream calculi for mobility and distribution, together with some of their variants: asynchronous -calculus, distributed -calculus,...
Daniele Gorla
DC
2010
11 years 11 months ago
A knowledge-based analysis of global function computation
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...
Joseph Y. Halpern, Sabina Petride
DC
2010
11 years 11 months ago
Refined quorum systems
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...
Rachid Guerraoui, Marko Vukolic
DC
2010
11 years 11 months ago
The impact of randomization in smoothing networks
Marios Mavronicolas, Thomas Sauerwald
DC
2010
11 years 11 months ago
Adaptive progress: a gracefully-degrading liveness property
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...
Marcos Kawazoe Aguilera, Sam Toueg
DC
2010
11 years 11 months ago
Model checking transactional memories
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...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
DC
2010
11 years 11 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
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,...
Johannes Schneider, Roger Wattenhofer
books