Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
Data communication in hypercubes
Journal of Parallel and Distributed Computing
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Hierarchical Interconnection Networks for Multicomputer Systems
IEEE Transactions on Computers
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
On Mapping Systolic Algorithms onto the Hypercube
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Bused Hypercubes and Other Pin-Optimal Networks
IEEE Transactions on Parallel and Distributed Systems
Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Extended Cube Connected Cycles: An Efficient Interconnection for Massively Parallel Systems
IEEE Transactions on Computers
Pancycles and hamiltonian-connectedness of the hierarchical cubic network
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
IEEE Transactions on Parallel and Distributed Systems
Node-to-Set Disjoint Paths Problem in Rotator Graphs
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
The Shuffle-Ring: Overcoming the Increasing Degree of Hypercube
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
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
Node-disjoint paths in hierarchical hypercube networks
Information Sciences: an International Journal
Finding cycles in hierarchical hypercube networks
Information Processing Letters
The new torus network design based On 3-dimensional hypercube
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
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
Node-disjoint paths in hierarchical hypercube networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Topological properties of hierarchical interconnection networks: a review and comparison
Journal of Electrical and Computer Engineering
Set-to-set disjoint-path routing in perfect hierarchical hypercubes
Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering
Cactus: a new constant-degree and fault tolerate p2p overlay
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
k-pairwise disjoint paths routing in perfect hierarchical hypercubes
The Journal of Supercomputing
Hi-index | 0.01 |
Interconnection networks play a crucial role in the performance of parallel systems. Thispaper introduces a new interconnection topology that is called the hierarchical hypercube(HHC). This topology is suitable for massively parallel systems with thousands ofprocessors. An appealing property of this network is the low number of connections perprocessor, which enhances the VLSI design and fabrication of the system. Other alluringfeatures include symmetry and logarithmic diameter, which imply easy and fast algorithms for communication. Moreover, the HHC is scalable; that is it can embed HHC's of lower dimensions. The paper presents two algorithms for data communication in the HHC. The first algorithm is for one-to-one transfer, and the second is for one-to-all broadcasting. Both algorithms take O(log/sub 2/k), where k is the total number of processors in the system. A wide class of problems, the divide & conquer class (D&Q), is shown to be easily and efficiently solvable on the HHC topology. Parallel algorithms are provided to describe how a D&Q problem can be solved efficiently on an HHC structure. The solution of a D&Q problem instance having up to k inputs requires a time complexity of O(log/sub 2/k).