Tightly Connected Hierarchical Interconnection Networks for Parallel Processors

Proceedings of the International Conference on Parallel Processing

Volumn 1, Issue , 1993, Pages 307-310

  Breznay, Peter Thomas ^a   Lopez, Mario Alberto ^a  

^a UNIVERSITY OF DENVER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MESH GENERATION; MESH NETWORKING;

BISECTION WIDTH; COMPLETE GRAPHS; HYPER-CUBES; HYPERCUBE; IN NETWORKS; LOW DEGREE; OPTIMAL CONNECTIVITY; PARALLEL PROCESSOR;

INTERCONNECTION NETWORKS (CIRCUIT SWITCHING);

EID: 0008875089     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.1993.178     Document Type: Conference Paper

References (7)

1. L. Bhuyan and D. Agrawal. Generalized hypercube and hyperbus structures for a computer network. IEEE Trans. Comp., 33(4):323-333, 1984.
2. P. Breznay and M.A. Lopez. A new class of hierarchical interconnection networks. Technical report, Dept, of Mathematics and Computer Science, University of Denver, 1993.
3. S. Dandamudi and D. Eager. Hierarchical interconnection networks for multicomputer systems. IEEE Trans. Comp., C-39(6):786-797, 1990.
4. S. Dandamudi and D. Eager. On hypercube-based hierarchical interconnection network design. J. Par. and Dist. Comp., 12:283-289, 1991.
5. J. R. Goodman and C. H. Sequin. Hypertree: A multiprocessor interconnection topology. IEEE Transactions on Computers, 30(12), 1981.
6. S. Latifi and A. El-Amawy. On folded hypercubes. In Proc. Int'l Conf, on Par. Proc, 1989.
7. F.P. Preparata and J. Vuillemin. The cube-connected cycles: A versatile network for parallel computation. Comm, of the ACM, 24(5):300-309, 1981.