|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
30th Annual Symposium on Foundations of Computer Science (FOCS 1989]
Research Triangle Park, NC, USA
October 30-November 01
ISBN: 0-8186-1982-1
| ASCII Text | x | ||
| T. Leighton, B. Maggs, "Expanders might be practical: fast algorithms for routing around faults on multibutterflies," Foundations of Computer Science, IEEE Annual Symposium on, pp. 384-389, 30th Annual Symposium on Foundations of Computer Science (FOCS 1989], 1989. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1989.63507, author = {T. Leighton and B. Maggs}, title = {Expanders might be practical: fast algorithms for routing around faults on multibutterflies}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1989}, isbn = {0-8186-1982-1}, pages = {384-389}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63507}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Expanders might be practical: fast algorithms for routing around faults on multibutterflies SN - 0-8186-1982-1 SP384 EP389 A1 - T. Leighton, A1 - B. Maggs, PY - 1989 KW - distributed-memory machine KW - multibutterflies KW - routing packets KW - robust KW - high-bandwidth KW - switching network VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
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.
Index Terms:
distributed-memory machine, multibutterflies, routing packets, robust, high-bandwidth, switching network
Citation:
T. Leighton, B. Maggs, "Expanders might be practical: fast algorithms for routing around faults on multibutterflies," focs, pp.384-389, 30th Annual Symposium on Foundations of Computer Science (FOCS 1989], 1989
Usage of this product signifies your acceptance of the Terms of Use.