Topological Properties of Hypercubes

IEEE Transactions on Computers

Volumn 37, Issue 7, 1988, Pages 867-872

  Saad, Youcef ^a   Schultz, Martin H ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

Binary n cube; characterization of hypercube graphs; hypercube imbeddings; hypercube networks; hypercube topology

Indexed keywords

COMPUTER ARCHITECTURE; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

BINARY N-CUBE; HIGHLY CONCURRENT LOOSELY COUPLED MULTIPROCESSOR; HYPERCUBE NETWORKS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0024051115     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.2234     Document Type: Article

References (9)

1. L. M.Adams, “Iterative algorithms for large sparse linear systemson parallel computers” Ph.D. dissertation,Univ. Virginia, Appf.Math., 1982. Also available as NASA Contractor Rep. 166027.
2. S. N. Bhatt and I. C. F. Ipsen, “How to imbed trees in hypercubes,” Res. Rep. 443, Dep. Comput. Sci., Yale Univ., 1985.
3. L. N. Bhuyan and D. P. Agrawal, “Generalized hypercube and hyperbus structures for a computer network,” IEEE Trans. Comput., vol. C-33, pp. 323–333, 1984.
4. S. A. Browning, “The tree machine: A highly concurrent computing environment,” Tech. Rep. TR-3760, Dep. Comput. Sci., California Instit. Technol., 1980.
5. A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, “The NYU Ultracomputer—Designing a MIMD shared memory parallel computer,” IEEE Trans. Comput., vol. C-32, pp. 175–189, 1983.
6. E. M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms. Englewood Cliffs, NJ: Prentice-Hall, 1977.
7. Y. Saad and M. H. Schultz, “Topological properties of hypercubes,” Res. Rep. 389, Dep. Comput. Science, Yale Univ., 1985.
8. C. L. Seitz, “The cosmic cube,” Commun. ACM, vol. 28, pp. 22–33, 1985.
9. A. Y. Wu, “Embedding of tree networks into hypercubes,” J. Parallel Distributed Comput., vol. 2, pp. 238–249, 1985.