WDAG
2004
Springer
14 years 5 months ago
2004
Springer
A central problem for structured peer-to-peer networks is topology maintenance, that is, how to properly update neighbor variables when nodes join and leave the network, possibly c...
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The most effective and practical dynamic-memory concurren...
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (hencheforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. Version vectors play a central role in update tracking under optimistic distributed systems, allowing the detection of obsolete or inconsistent versions of replicated dat...
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
We study the power of reliable anonymous distributed systems, where processes do not fail, do not have identifiers, and run identical programmes. We are interested specifically i...