Layered Cross Product - A Technique to Construct Interconnection Networks

Networks

Volumn 29, Issue 4, 1997, Pages 219-223

  Even, Shimon ^a   Litman, Ami ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS);

CROSS PRODUCT; LAYERED GRAPHS;

INTERCONNECTION NETWORKS (CIRCUIT SWITCHING);

EID: 0002620064     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1097-0037(199707)29:4<219::aid-net5>3.0.co;2-i     Document Type: Article

References (11)

1. V. Beneš, Permutation groups, complexes, and rearrangeable multistage connecting network. Bell Syst. Tech. J. 43 (1964) 1619-1640.
2. G. R. Goke and G. J. Lipovski, Banyan networks for partitioning multiprocessor systems. 1st Annual Symposium on Computer Architecture, Florida (1973) 21-28.
3. R. I. Greenberg, "Efficient Interconnection Schemes for VLSI and Parallel Computation," Ph.d. Thesis, MIT, 1989.
4. R. I. Greenberg and C. E. Leiserson, Randomized routing on fat-trees. Randomness and Computation (S. Micali, Ed.). Advances in Computing Research, JAI Press 5 (1989) 345-374.
5. C. P. Kruskal and M. Snir, A unified theory of interconnection network structure. Theor. Comp. Sci. 48 (1986) 75-94.
6. T. Leighton, Parallel computation using meshes of trees. Proceedings of the WG'83: International Workshop on Graphtheoretic Concepts in Computer Science (M. Nagl and J. Perl, Eds.). Trauner Verlag (1984) 200-218.
7. F. T. Leighton, B. M. Maggs, A. G. Ranade, and S. B. Rao, Randomized routing and sorting on fixed-connection networks. J. Alg. 17(1) (1994) 157-205.
8. C. E. Leiserson, Fat-trees: Universal networks for hardware-efficient supercomputing. IEEE Trans. Comp. c-34(10) (1985) 892-901.
9. N. Pippenger, Telephone switching networks. Proceedings of Symposia in Applied Mathematics. American Mathematical Society 26 (1982) 101-133.
10. E. Upfal, An O(log N) deterministic packet-routing scheme. J. ACM 29(1) (1992) 55-70.
11. A. Waksman, A permutation network. J. ACM 15(1) (1968) 159-163.