DocumentCode
922127
Title
Topological properties of hypercubes
Author
Saad, Youcef ; Schultz, Martin H.
Author_Institution
Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
Volume
37
Issue
7
fYear
1988
fDate
7/1/1988 12:00:00 AM
Firstpage
867
Lastpage
872
Abstract
The n -dimensional hypercube is a highly concurrent loosely coupled multiprocessor based on the binary n -cube topology. Machines based on the hypercube topology have been advocated as ideal parallel architectures for their powerful interconnection features. The authors examine the hypercube from the graph-theory point of view and consider those features that make its connectivity so appealing. Among other things, they propose a theoretical characterization of the n -cube as a graph and and show how to map various other topologies into a hypercube
Keywords
multiprocessing systems; parallel architectures; binary n-cube topology; graph-theory; highly concurrent loosely coupled multiprocessor; hypercubes; parallel architectures; topological properties; Automatic testing; Circuit faults; Circuit testing; Fault tolerance; Hypercubes; Logic gates; Logic testing; Network topology; Programmable logic arrays; Very large scale integration;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.2234
Filename
2234
Link To Document