The connection machine
Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
The Cubical Ring Connected Cycles: A Fault Tolerant Parallel Computation Network
IEEE Transactions on Computers
Spanning balanced trees in Boolean cubes
SIAM Journal on Scientific and Statistical Computing
Supercube: An optimally fault tolerant network architecture
Acta Informatica
The HCN: a versatile interconnection network based on cubes
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Mapping pyramid algorithms into hypercubes
Journal of Parallel and Distributed Computing
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
Processor allocation for a class of hypercube-like supercomputers
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Comments on "Hierarchical Cubic Networks"
IEEE Transactions on Parallel and Distributed Systems
A Unified Formulation of Honeycomb and Diamond Networks
IEEE Transactions on Parallel and Distributed Systems
Metacube: a new interconnection network for large scale parallel systems
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Automatic Reconfiguration and Yield of the TESH Multicomputer Network
IEEE Transactions on Computers
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
The Shuffle-Ring: Overcoming the Increasing Degree of Hypercube
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Multilayer VLSI Layout for Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Efficient Collective Communications in Dual-Cube
The Journal of Supercomputing
The Josephus Cube: analysis of routing and fault tolerance
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Hypercube and Its Variant Networks: A Topological Evaluation
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Robust scalability analysis and SPM case studies
The Journal of Supercomputing
Fault-tolerant cycle embedding in dual-cube with node faults
International Journal of High Performance Computing and Networking
International Journal of High Performance Computing and Networking
HPGRID: a novel architectural model for resource management systems
Proceedings of the 2011 International Conference on Communication, Computing & Security
International Journal of Computer Applications in Technology
Hamiltonian cycles in hypercubes with faulty edges
Information Sciences: an International Journal
| Hi-index | 0.00 |
The binary hypercube has been one of the most frequently chosen interconnectionnetworks for parallel computers because it provides low diameter and is so robust that itcan very efficiently emulate a wide variety of other frequently used networks. However,the major drawback of the hypercube is the increase in the number of communicationchannels for each processor with an increase in the total number of processors in thesystem. This drawback has a direct effect on the very large scale integration complexityof the hypercube network. This short note proposes a new topology that is producedfrom the hypercube by a uniform reduction in the number of edges for each node. Thisedge reduction technique produces networks with lower complexity than hypercubeswhile maintaining, to a high extent, the powerful hypercube properties. An extensivecomparison of the proposed reduced hypercube (RH) topology with the conventionalhypercube is included. It is also shown that several copies of the popularcube-connected cycles network can be emulated simultaneously by an RH with dilation 1.