Improved methods for hiding latency in high bandwidth networks (extended abstract)
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Random Regular Graphs with Edge Faults: Expansion through Cores
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Efficient automatic simulation of parallel computation on networks of workstations
Discrete Applied Mathematics
Broadcasting vs. mixing and information dissemination on Cayley graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On mixing and edge expansion properties in randomized broadcasting
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
The Akamai network: a platform for high-performance internet applications
ACM SIGOPS Operating Systems Review
On randomized broadcasting in power law networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
On the runtime and robustness of randomized broadcasting
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Resilience and reliability analysis of P2P network systems
Operations Research Letters
An efficient routing methodology to tolerate static and dynamic faults in 2-D mesh networks-on-chip
Microprocessors & Microsystems
| Hi-index | 0.00 |
The authors analyze the fault-tolerance properties of several bounded-degree networks that are commonly used for parallel computation. Among other things, they show that an N-node butterfly containing N/sup 1- epsilon / worst-case faults (for any constant epsilon 0) can emulate a fault-free butterfly of the same size with only constant slowdown. Similar results are proved for the shuffle-exchange graph. Hence, these networks become the first connected bounded-degree networks known to be able to sustain more than a constant number of worst-case faults without suffering more than a constant-factor slowdown in performance. They also show that an N-node butterfly whose nodes fail with some constant probability p can emulate a fault-free version of itself with a slowdown of 2/sup O(log* N)/, which is a very slowly increasing function of N. The proofs of these results combine the technique of redundant computation with new algorithms for routing packets around faults in hypercubic networks. Techniques for reconfiguring hypercubic networks around faults that do not rely on redundant computation are also presented. These techniques tolerate fewer faults but are more widely applicable since they can be used with other networks such as binary trees and meshes of trees.