Sciweavers

4 search results - page 1 / 1
» Message-Optimal and Latency-Optimal Termination Detection Al...
Sort
View
101
Voted
WDAG
2004
Springer
86views Algorithms» more  WDAG 2004»
15 years 4 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
JSS
1998
90views more  JSS 1998»
14 years 10 months ago
A taxonomy of distributed termination detection algorithms
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
Jeff Matocha, Tracy Camp
DC
2007
14 years 11 months ago
A family of optimal termination detection algorithms
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 a...
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri
76
Voted
CORR
2006
Springer
85views Education» more  CORR 2006»
14 years 11 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil