Communications of the ACM - Special section on computer architecture
Optimal partitioning of randomly generated distributed programs
IEEE Transactions on Software Engineering
Interconnection networks: physical design and performance analysis
Journal of Parallel and Distributed Computing
Data movement techniques for the pyramid computer
SIAM Journal on Computing
IEEE Transactions on Computers
Pyramidal systems for computer vision
Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
Performance of the Direct Binary n-Cube Network for Multiprocessors
IEEE Transactions on Computers
The HCN: a versatile interconnection network based on cubes
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
A transputer-based extended hypercube
Microprocessing and Microprogramming
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Embedding trees in the hypercube
Embedding trees in the hypercube
Comparison of hypercube, hypernet, and symmetric hypernet architectures
ACM SIGARCH Computer Architecture News
Efficient embeddings into the hypercube using matrix transformations
ICS '95 Proceedings of the 9th international conference on Supercomputing
The Extended Cube Connected Cycles: An Efficient Interconnection for Massively Parallel Systems
IEEE Transactions on Computers
Embedding Hierarchical Hypercube Networks into the Hypercube
IEEE Transactions on Parallel and Distributed Systems
Comments on "Hierarchical Cubic Networks"
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Parallel & Distributed Technology: Systems & Technology
Automatic Reconfiguration and Yield of the TESH Multicomputer Network
IEEE Transactions on Computers
The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
What Designers of Bus and Network Architectures Should Know about Hypercubes
IEEE Transactions on Computers
Concurrent rollback for crash recovery in extended hypercube networks
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
The hierarchical cliques interconnection network
Journal of Parallel and Distributed Computing
An oblivious shortest-path routing algorithm for fully connected cubic networks
Journal of Parallel and Distributed Computing
International Journal of High Performance Computing and Networking
Technology-Driven, Highly-Scalable Dragonfly Topology
ISCA '08 Proceedings of the 35th Annual International Symposium on Computer Architecture
Fault-tolerant resource placement in balanced hypercubes
Information Sciences: an International Journal
Self-healing in binomial graph networks
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
A class of hierarchical graphs as topologies for interconnection networks
Theoretical Computer Science
HPGRID: a novel architectural model for resource management systems
Proceedings of the 2011 International Conference on Communication, Computing & Security
Topological properties of hierarchical interconnection networks: a review and comparison
Journal of Electrical and Computer Engineering
International Journal of Computer Applications in Technology
High and stable performance under adverse traffic patterns of tori-connected torus network
Computers and Electrical Engineering
| Hi-index | 0.01 |
A new interconnection topology-the extended hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a constant predefined building block. The extended hypercube retains the positive features of the k-cube at different levels of hierarchy and at the same time has some additional advantages like reduced diameter and constant degree of a node. The paper presents an introduction to the topology of the extended hypercube and analyzes its architectural potential in terms of message routing and executing a classof highly parallel algorithms. Topological properties and performance studies of the extended hypercube are presented.