Hierarchical cubic networks

We introduce a new interconnection network for large-scale distributed memory multiprocessors called the hierarchical cubic network (HCN). We establish that the number of routing steps needed by several data parallel applications running on a HCN-based system and a hypercube-based system are about i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems Jg. 6; H. 4; S. 427 - 435
Hauptverfasser: Ghose, K., Desai, K.R.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Los Alamitos, CA IEEE 01.04.1995
IEEE Computer Society
Schlagworte:
Applied sciences
Computer network reliability
Computer science
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Distributed databases
Exact sciences and technology
Fault tolerance
Hypercubes
Multiprocessor interconnection networks
Routing
Software
Software engineering
Synchronization
Telecommunication network reliability
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Voting
Multiprocessor
Hierarchy
Parallel algorithm
Computer network
Optimal algorithm
Hypercube
Interconnected power system
Recursive method
Routing
ISSN:1045-9219
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We introduce a new interconnection network for large-scale distributed memory multiprocessors called the hierarchical cubic network (HCN). We establish that the number of routing steps needed by several data parallel applications running on a HCN-based system and a hypercube-based system are about identical. Further, hypercube connections can be emulated on the HCN in constant time. Simulation of uniform and localized traffic patterns reveal that the normalized average internode distances in a HCN are better than in a comparable hypercube. Additionally, the HCN also has about three-fourths the diameter of a comparable hypercube, although it uses about half as many links per node-a fact that has positive ramifications on the implementation of HCN-connected systems.< >
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1045-9219
DOI:10.1109/71.372797