WDAG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
WDAG
2004
Springer
13 years 10 months ago
2004
Springer
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
WDAG
2004
Springer
13 years 10 months ago
2004
Springer
In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; a...
WDAG
2004
Springer
13 years 10 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
13 years 10 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
13 years 10 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
13 years 10 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
13 years 10 months ago
2004
Springer
WDAG
2004
Springer
13 years 10 months ago
2004
Springer
WDAG
2004
Springer
13 years 10 months ago
2004
Springer
