DocumentCode
2748063
Title
Oblivious deadlock-free routing in a faulty hypercube
Author
Kim, Jin Suk ; Lehman, Eric ; Leighton, Tom
Author_Institution
Lab. for Comput. Sci., MIT, Cambridge, MA, USA
fYear
1999
fDate
12-16 Apr 1999
Firstpage
312
Lastpage
319
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
Keywords
hypercube networks; network routing; operating systems (computers); parallel processing; deadlock configurations; deadlock-free routing algorithm; faulty hypercube; massively parallel computing; massively parallel system; message routing; oblivious deadlock-free routing; worst-case configuration; Adaptive algorithm; Communication channels; Computer science; Hypercubes; Laboratories; Mathematics; Parallel processing; Routing; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1999. 13th International and 10th Symposium on Parallel and Distributed Processing, 1999. 1999 IPPS/SPDP. Proceedings
Conference_Location
San Juan
Print_ISBN
0-7695-0143-5
Type
conf
DOI
10.1109/IPPS.1999.760493
Filename
760493
Link To Document