Sciweavers

16 search results - page 2 / 4
» wdag 2004
Sort
View
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
13 years 10 months ago
Distributed Weighted Matching
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...
Mirjam Wattenhofer, Roger Wattenhofer
WDAG
2004
Springer
86views Algorithms» more  WDAG 2004»
13 years 10 months ago
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
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 ...
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri
WDAG
2004
Springer
122views Algorithms» more  WDAG 2004»
13 years 10 months ago
Active and Concurrent Topology Maintenance
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...
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
WDAG
2004
Springer
113views Algorithms» more  WDAG 2004»
13 years 10 months ago
Bounded Version Vectors
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...
José Bacelar Almeida, Paulo Sérgio A...
WDAG
2004
Springer
134views Algorithms» more  WDAG 2004»
13 years 10 months ago
An Optimistic Approach to Lock-Free FIFO Queues
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...
Edya Ladan-Mozes, Nir Shavit