On-line algorithms for path selection in a nonblocking network

SIAM Journal on Computing

Volumn 25, Issue 3, 1996, Pages 600-625

  Arora, Sanjeev ^a   Leighton, F T ^b   Maggs, Bruce M ^c  

^a Princeton University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Carnegie Mellon University   (United States)

Author keywords

Multi bene ; Multibutterfly network; Network; Nonblocking network; Routing algorithm

Indexed keywords

EID: 0000956452     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539791221499     Document Type: Article

References (38)

1. W. A. AIELLO, F. T. LEIGHTON, B. M. MAGGS, AND M. NEWMAN, Fast algorithms for bit-serial routing on a hypercube, Math. Systems Theory, 24 (1991), pp. 253-271.
2. M. AJTAI, J. KOMLÓS, AND E. SZEMERÉDI, Sorting in clog n parallel steps, Combinatorica, 3 (1983), pp. 1-19.
3. L. A. BASSALYGO AND M. S. PINSKER, Complexity of an optimum nonblocking switching network without reconnections, Problems Inform. Transmission, 9 (1974), pp. 64-66.
4. _, Asymptotically optimal networks for generalized rearrangeable switching and generalized switching without rearrangement, Problemy Peredachi Informatsii, 16 (1980), pp. 94-98.
5. B. BEIZER, The analysis and synthesis of signal switching networks, in Proc. Symposium on Mathematical Theory of Automata, Brooklyn Polytechnic Institute, Brooklyn, NY, 1962, pp. 563-576.
6. V. E. BENEŠ, Optimal rearrangeable multistage connecting networks, Bell System Technical J., 43 (1964), pp. 1641-1656.
7. D. G. CANTOR, On construction of non-blocking switching networks, in Proc. Symposium on Computer Communication Networks and Teletraffic, Brooklyn Polytechnic Institute, Brooklyn, NY, 1972, pp. 253-255.
8. D. DOLEV, C. DWORK, N. PIPPENGER, AND A. WIDGERSON, Superconcentrators, generalizers and generalized connectors with limited depth, in Proc. 15th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1983, pp. 42-51.
9. P. FELDMAN, J. FRIEDMAN, AND N. PIPPENGER, Non-blocking networks, in Proc. 18th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1986, pp. 247-254.
10. _, Wide-sense nonblocking networks, SIAM J. Discrete Math., 1 (1988), pp. 158-173.
11. J. FRIEDMAN, A lower bound on strictly non-blocking networks, Combinatorica, 8 (1988), pp. 185-188.
12. A. V. GOLDBERG, B. M. MAGGS, AND S. A. PLOTKIN, A parallel algorithm for reconfiguring a multibutterfly network with faulty switches, IEEE Trans. Comput., 43 (1994), pp. 321-326.
13. N. KAHALE, Better expansion for Ramanujan graphs, in Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Piscataway, NJ, 1991, pp. 398-404.
14. C. P. KRUSKAL AND M. SNIR, A unified theory of interconnection network structure, Theoret. Comput. Sci., 48 (1986), pp. 75-94.
15. F. T. LEIGHTON, Parallel computation using meshes of trees, in 1983 Workshop on Graph-Theoretic Concepts in Computer Science, Trauner Verlag, Linz, 1984, pp. 200-218.
16. _, Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
17. F. T. LEIGHTON AND B. M. MAGGS, Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks, IEEE Trans. Comput., 41 (1992), pp. 578-587.
18. T. LEIGHTON, C. E. LEISERSON, AND D. KRAVETS, Theory of parallel and VLSI computation, Research Seminar Series Report MIT/LCS/RSS 8, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1990.
19. T. LEIGHTON, D. LISINSKI, AND B. MAGGS, Empirical evaluation of randomly-wired multistage networks, in Proc. 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors, IEEE Computer Society Press, Piscataway, NJ, 1990, pp. 380-385.
20. T. LEIGHTON AND G. PLAXTON, A (fairly) simple circuit that (usually) sorts, in Proc. 31st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Piscataway, NJ, 1990, pp. 264-274.
21. C. E. LEISERSON, Fat-trees: Universal networks for hardware-efficient supercomputing, IEEE Trans. Comput., C-34 (1985), pp. 892-901.
22. G. LIN AND N. PIPPENGER, Parallel algorithms for routing in non-blocking networks, in Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, Association for Computing Machinery, New York, 1991, pp. 272-277.
23. G. A. MARGULIS, Explicit constructions of concentrators, Problems Inform. Transmission, 9 (1973), pp. 325-332.
24. G. M. MASSON AND B. W. JORDAN, JR., Generalized multi-stage connection networks, Networks, 2 (1972), pp. 191-209.
25. D. NASSIMI AND S. SAHNI, Parallel permutation and sorting algorithms and a new generalized connection network, J. Assoc. Comput. Mach., 29 (1982), pp. 642-667.
26. Y. P. OFMAN, A universal automaton, Trans. Moscow Math. Soc., 14 (1965), pp. 186-199.
27. D. PELEG AND E. UPFAL, Constructing disjoint paths on expander graphs, in Proc. 19th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1987, pp. 264-273.
28. N. PIPPENGER, The complexity theory of switching networks, Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cam-bridge, MA, 1973.
29. _, On rearrangeable and nonblocking switching networks, J. Comput. System Sci., 17 (1978), pp. 145-162.
30. _, Telephone switching networks, in Proc. Symposia in Applied Mathematics, vol. 26, American Mathematical Society, Providence, RI, 1982, pp. 101-133.
31. _, Self-routing superconcentrators, in Proc. 25th Annual ACM Symposium on the Theory of Computing, Association for Computing Machinery, New York, 1993, pp. 355-361.
32. N. PIPPENGER AND L. G. VALIANT, Shifting graphs and their applications, J. Assoc. Comput. Mach., 23 (1976), pp. 423-432.
33. N. PIPPENGER AND A. C. YAO, Rearrangeable networks with limited depth, SIAM J. Algebraic Discrete Meth., 3 (1982), pp. 411-417.
34. J. H. REIF AND L. G. VALIANT, A logarithmic time sort for linear size networks, J. Assoc. Comput. Mach., 34 (1987), pp. 60-76.
35. C. E. SHANNON, Memory requirements in a telephone exchange, Bell System Technical J., 29 (1950), pp. 343-349.
36. J. S. TURNER, Practical wide-sense nonlocking generalized connectors, Technical Report WUCS-88-29, Department of Computer Science, Washington University, St. Louis, MO, 1988.
37. E. UPFAL, An O(log N) deterministic packet routing scheme, in Proc. 21st Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1989, pp. 241-250.
38. A. WAKSMAN, A permutation network, J. Assoc. Comput. Mach., 15 (1968), pp. 159-163.