Sciweavers

Share
2 search results - page 1 / 1
» Application-aware deadlock-free oblivious routing
Sort
View
IPPS
1999
IEEE
10 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 parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
books