DocumentCode
2196741
Title
Expanders might be practical: fast algorithms for routing around faults on multibutterflies
Author
Leighton, Tom ; Maggs, Bruce
Author_Institution
Dept. of Math., MIT, Cambridge, MA, USA
fYear
1989
fDate
30 Oct-1 Nov 1989
Firstpage
384
Lastpage
389
Abstract
Simple deterministic O (log N )-step algorithms for routing packets on a multibutterfly are described. The algorithms are shown to be robust against faults, even in the worst case, and to be efficient from a practical point of view. As a consequence, the multibutterfly is shown to be an excellent candidate for a high-bandwidth, low-diameter switching network underlying a distributed-memory machine
Keywords
packet switching; switching networks; distributed-memory machine; high-bandwidth; multibutterflies; robust; routing packets; switching network; Computer science; Context; Contracts; Joining processes; Mathematics; Merging; Robustness; Routing; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1989., 30th Annual Symposium on
Conference_Location
Research Triangle Park, NC
Print_ISBN
0-8186-1982-1
Type
conf
DOI
10.1109/SFCS.1989.63507
Filename
63507
Link To Document