Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 312-319 |
| Number of pages | 8 |
| Journal | Proceedings of the International Parallel Processing Symposium, IPPS |
| State | Published - 1999 |
| Event | Proceedings of the 1999 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing - San Juan Duration: 12 Apr 1999 → 16 Apr 1999 |