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 Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.98 |
The hypercube structure is a very widely used interconnection topology because of its appealing topological properties. For massively parallel systems with thousands of processors, the hypercube suffers from a high node fanout which makes such systems impractical and infeasible. In this paper, we introduce an interconnection network called The Extended Cube Connected Cycles (ECCC) which is suitable for massively parallel systems. In this topology the processor fanout is fixed to four. Other attractive properties of the ECCC include a diameter of logarithmic order and a small average interprocessor communication distance which imply fast data transfer. The paper presents two algorithms for data communication in the ECCC. The first algorithm is for node-to-node communication and the second is for node-to-all broadcasting. Both algorithms take O(log N) time units, where N is the total number of processors in the system. In addition, the paper shows that a wide class of problems, the divide and conquer class, is easily and efficiently solvable on the ECCC topology. The solution of a divide and conquer problem of size N requires O(log N) time units.