S. Arora
T. Leighton
- 1.W. Aiello, T. Leighton, B. Maggs, and M. Newman. Fast algorithms for bit-serial routing on a hypercube. Unpublished manuscript.Google Scholar
- 2.M. Ajtai, J. Komlos, and E. Szemeredi. An O(N log N) sorting network. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 1-9, April 1983. Google ScholarDigital Library
- 3.L. A. Bassalygo and M. S. Pinsker. Complexity of optimum nonblocking switching network without reconnections. Problems of Information Transmission, 9:64-66, 1974.Google Scholar
- 4.L. A. Bassalygo and M. S. Pinsker. Asymptotically optimal networks for generalized rearrangeable switching and generalized switching without rearrangement. Problemy Peredachi Informatsii, 16:94-98, 1980.Google Scholar
- 5.V. E. Benes. Optimal rearrangeable multistage connecting networks. Bell System Technical Journal, 43:1641-1656, July 1964.Google ScholarCross Ref
- 6.D. G. Cantor. On non-blocking switching networks. Networks, 1:367-377, 1971.Google ScholarCross Ref
- 7.D. Dolev, C. Dwork, N. Pippenger, and A. Widgerson. Superconcentrators, generalizers and generalized connectors with limited depth. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 42-51, April 1983. Google ScholarDigital Library
- 8.P. Feldman, J. Friedman, and N. Pippenger. Nonblocking networks. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 247-254, May 1986. Google ScholarDigital Library
- 9.P. Feldman, J. Friedman, and N. Pippenger. Widesense nonblocking networks. SlAM Journal of Discrete Mathematics, 1(2):158-173, May 1988. Google ScholarDigital Library
- 10.J. Friedman. A lower bound on strictly nonblocking networks. Combinatorica, 8(2):185-188, 1988.Google ScholarCross Ref
- 11.C. P. Kruskal and M. Snir. A unified theory of interconnection network structure. Theoretical Computer Science, 48:75-94, 1986. Google ScholarDigital Library
- 12.F. T. Leighton. Parallel computation using meshes of trees. In 1983 Workshop on Graph-Theoretic Concepts in Computer Science, pages 200-218, Linz, 1984. Trauner Verlag.Google Scholar
- 13.T. Leighton and B. Maggs. Expanders might be practical: fast algorithms for routing around faults in multibutterflies. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 384-389. IEEE, October 1989.Google ScholarDigital Library
- 14.C. E. Leiserson. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, C-34(10):892-901, October 1985. Google ScholarDigital Library
- 15.G. A. Margulis. Explicit constructions of concentrators. Problems of Information Transmission, 9:325-332, 1973.Google Scholar
- 16.G. M. Masson and B. W. Jordan, Jr. Generalized multi-stage connection networks. Networks, 2:191- 209, 1972.Google ScholarCross Ref
- 17.D. Nassimi and S. Sahni. Parallel permutation and sorting algorithms and a new generalized connection network. Journal of the ACM, 29(3):642-667, July 1982. Google ScholarDigital Library
- 18.Yu. P. Ofman. A universal automaton. Transactions of the Moscow Mathematical Society, 14:186- 199, 1965.Google Scholar
- 19.N. Pippenger. Personal communication.Google Scholar
- 20.N. Pippenger. The complexity theory of switching networks. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1973.Google Scholar
- 21.N. Pippenger. On rearrangeable and nonblocking switching networks. Journal of Computer and System Sciences, 17:145-162, 1978.Google ScholarCross Ref
- 22.N. Pippenger. Telephone switching networks. In Proceedings of Symposia in Applied Mathematics, volume 26, pages 101-133, 1982.Google Scholar
- 23.N. Pippenger and L. G. Valiant. Shifting graphs and their applications. Journal of the ACM, 23:423-432, 1976. Google ScholarDigital Library
- 24.N. Pippenger and A. C.-C. Yao. Rearrangeable networks with limited depth. SIAM Journal of Algebraic and Discrete Methods, 3:411-417, 1982.Google ScholarCross Ref
- 25.C. E. Shannon. Memory requirements in a telephone exchange. Bell System Technical Journal, 29:343-349, 1950.Google ScholarCross Ref
- 26.J. S. Turner. Practical wide-sense nonblocking generalized connectors. Technical Report WUCS-88- 29, Department of Computer Science, Washington University, St. Louis, MO, 1989.Google Scholar
- 27.E. Upfal. An O(log N) deterministic packet routing scheme. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 241- 250, May 1989. Google ScholarDigital Library
Index Terms
- On-line algorithms for path selection in a nonblocking network
Recommendations
Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks
We study the connection capacity of a class of rearrangeable nonblocking (RNB) and strictly nonblocking (SNB) networks with/without crosstalk-free constraint, model their routing problems as weak or strong edge-colorings of bipartite graphs, and propose ...
Path selection algorithm: the strategy for designing deterministic routing from alternative paths
System Area Networks (SANs), which usually accept irregular topologies, have been used to connect nodes in PC/WS clusters or high-performance storage systems. Although routing algorithms for SANs usually find out alternative paths, SANs usually accept ...
Comments