Sciweavers

Share
IPPS
1999
IEEE

Oblivious Deadlock-Free Routing in a Faulty Hypercube

9 years 4 months ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parallel system, some processors are bound to fail, disrupting message routing. Second, one must avoid deadlock configurations in which messages permanently block one another. We present an efficient, oblivious, and deadlock-free routing algorithm for the hypercube. The algorithm tolerates a large number of faults in a worst-case configuration.
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where IPPS
Authors Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
Comments (0)
books