
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
F.T. Leighton, B.M. Maggs, "Fast Algorithms for Routing Around Faults in Multibutterflies and RandomlyWired Splitter Networks," IEEE Transactions on Computers, vol. 41, no. 5, pp. 578587, May, 1992.  
BibTex  x  
@article{ 10.1109/12.142684, author = {F.T. Leighton and B.M. Maggs}, title = {Fast Algorithms for Routing Around Faults in Multibutterflies and RandomlyWired Splitter Networks}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {5}, issn = {00189340}, year = {1992}, pages = {578587}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.142684}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Fast Algorithms for Routing Around Faults in Multibutterflies and RandomlyWired Splitter Networks IS  5 SN  00189340 SP578 EP587 EPD  578587 A1  F.T. Leighton, A1  B.M. Maggs, PY  1992 KW  fault routing algorithms; deterministic; algorithms; packet permutations routing; multibutterflies; randomlywired splitter networks; switching network; sharedmemory machine; computational complexity; fault tolerant computing; multiprocessor interconnection networks. VL  41 JA  IEEE Transactions on Computers ER   
Simple deterministic O(log N)step algorithms for routing permutations of packets in multibutterflies and randomly wired splitter networks are described. The algorithms are robust against faults (even in the worst case), and are efficient from a practical point of view. As a consequence, it is found that the multibutterfly is an excellent candidate for a highbandwidth lowdiameter switching network underlying a sharedmemory machine.
[1] M. Ajtai, J. Komlos, and E. Szemeredi, "AnO(nlogn) sorting network,"Combinatorica, vol. 3, pp. 119, 1983.
[2] S. Arora, T. Leighton, and B. Maggs, "Online algorithms for path selection in a nonblocking network," inProc. 22nd Annu. ACM Symp. Theory Comput., May 1990, pp. 149158.
[3] L. A. Bassalygo and M. S. Pinsker, "Complexity of an optimum nonblocking switching network without reconnections,"Problems Inform. Transmission, vol. 9, pp. 6466, 1974.
[4] F. Chong, E. Egozy, and A. DeHon, "Fault tolerance and performance of multipath multistage interconnection networks," inAdvanced Research in VLSI: Proc. MIT/Brown Conf. 1992, T. F. Knight, Jr. and J. Savage, Eds. Cambridge, MA: MIT Press, Mar. 1992, to be published.
[5] A. DeHon, T. Knight, and H. Minsky, "Faulttolerant design for multistage routing networks," inProc. Int. Symp. Shared Memory Multiprocessing, Inform. Processing Soc. of Japan, Apr. 1991.
[6] C. Dwork, D. Peleg, N. Pippenger, and E. Upfal, "Byzantine agreement in faulty networks,"SIAM J. Comput., vol. 17, no. 5, pp. 975988, 1988.
[7] S. E. Fahlman, "The hashnet interconnection scheme," Tech. Rep. CMUCS80125, Dep. Comput. Sci., CarnegieMellon Univ., Pittsburgh, PA, June 1980.
[8] J. Friedman and N. Pippenger, "Expanding graphs contain all small trees,"Combinatorica, vol. 7, no. 1, pp. 7176, 1987.
[9] A. V. Goldberg, S. A. Plotkin, and B. M. Maggs, "A parallel algorithm for reconfiguring a multibutterfly network with faults," unpublished manuscript, Dec. 1991.
[10] J. Hastad, T. Leighton, and M. Newman, "Fast computation using faulty hypercubes," inProc. 21st Annu. ACM Symp. Theory Comput., May 1989, pp. 251263.
[11] N. Kahale, "Better expansion for ramanujan graphs," inProc. 32nd Annu. Symp. Foundations Comput. Sci., IEEE, Oct. 1991, pp. 398404.
[12] C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, and A. Tsantilas, "Asymptotically tight bounds for computing with faulty arrays of processors," inProc. 31st Annu. Symp. Foundations Comput. Sci., IEEE, Oct. 1990, pp. 285296.
[13] T. F. Knight, Jr., "Technologies for low latency interconnection switches," inProc. 1989 ACM Symp. Parallel Algorithms and Architectures, June 1989, pp. 351358.
[14] R. R. Koch, "Increasing the size of a network by a constant factor can increase performance by more than a constant factor," inProc. 29th Annu. Symp. Foundations Comput. Sci., IEEE, Oct. 1988, pp. 221230.
[15] S. Konstantinidou and E. Upfal, "Experimental comparison of multistage networks," IBM Almaden Research Center, unpublished manuscript, 1991.
[16] C. P. Kruskal and M. Snir, "The performance of multistage interconnection networks for multiprocessors,"IEEE Trans. Comput., vol. C32, pp. 10911098, Dec. 1983.
[17] C. P. Kruskal and M. Snir, "A unified theory of interconnection network structure,"Theoret. comput. Sci., vol. 48, pp. 7594, 1986.
[18] T. Leighton, "Tight bounds on the complexity of parallel sorting,"IEEE Trans. Comput., vol. C34, no. 4, pp. 344354, Apr. 1985.
[19] F. T. Leighton and B. M. Maggs, "Introduction to parallel algorithms and architectures: Expanders, PRAM's, VLSI," manuscript in preparation.
[20] T. Leighton, C. L. Leiserson, and M. Klugerman, "Theory of parallel and VLSI computation," Research Seminar Series Rep. MIT/LCS/RSS 10, MIT Lab. for Comput. Sci., May 1991.
[21] J. Lim,TwoDimensional Signal and Image Processing. Englewood Cliffs, NJ: PrenticeHall, 1990.
[22] C. E. Leiserson, "Fattrees: Universal networks for hardwareefficient supercomputing,"IEEE Trans. Comput., vol. C34, pp. 892900, Oct. 1985.
[23] A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan graphs,"Combinatorica, vol. 8, no. 3, pp. 261277, 1988.
[24] S. K. Park and K. W. Miller, "Random number generators: Good ones are hard to find,"Commun. ACM, vol. 31, pp. 11921201, Oct. 1988.
[25] M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance,"J. ACM, vol. 36, no. 2, Apr. 1989.
[26] P. Raghavan, "Robust algorithms for packet routing in a mesh," inProc. 1989 ACM Symp. Parallel Algorithms and Architectures, June 1989, pp. 344350.
[27] R. D. Rettberg, W. R. Crowther, P. P. Carvey, and R. S. Tomlinson, "The monarch parallel processor hardware design,"IEEE Comput. Mag., vol. 23, no. 4, pp. 1830, Apr. 1990.
[28] C. D. Thompson, "A complexity theory for VLSI," Ph.D. dissertation, Dep. Comput. Sci., Carnegie Mellon Univ., 1980.
[29] E. Upfal, "AnO(logN) deterministic packet routing scheme," inProc. 21st Annu. ACM Symp. Theory Comput., May 1989, pp. 241250.