Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Multicast in hypercube multiprocessors
Journal of Parallel and Distributed Computing
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
RH: A Versatile Family of Reduced Hypercube Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Circuit-Switched Broadcasting in Torus Networks
IEEE Transactions on Parallel and Distributed Systems
The SGI Origin: a ccNUMA highly scalable server
Proceedings of the 24th annual international symposium on Computer architecture
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
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
Fault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
The Recursive Dual-Net and Its Applications
APPT '09 Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies
Hamiltonian connectivity and globally 3*-connectivity of dual-cube extensive networks
Computers and Electrical Engineering
Mutually independent Hamiltonian cycles in dual-cubes
The Journal of Supercomputing
Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
Information Sciences: an International Journal
Finding a hamiltonian cycle in a hierarchical dual-net with base network of p -ary q -cube
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Binomial-tree fault tolerant routing in dual-cubes with large number of faulty nodes
CIS'04 Proceedings of the First international conference on Computational and Information Science
Parallel prefix computation in the recursive dual-net
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Mstar: a new two level interconnection network
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
The domination number of exchanged hypercubes
Information Processing Letters
| Hi-index | 0.00 |
The hypercube, or n-cube, has been widely used as the interconnection network in parallel computers. However, the major drawback of the hypercube is the increase in the number of communication links for each node with the increase in the total number of nodes in the system. This paper introduces a new interconnection network, namely dual-cube, for large-scale parallel computers and describes the algorithms for efficient collective communications in dual-cube. The dual-cube network mitigates the problem of increasing number of links in the large-scale hypercube network while retains hypercube’s topological properties. Design of efficient routing algorithms for collective communications is the key issue for any interconnection network. In this paper, we show that the collective communications can be done in dual-cube with almost the same communication times as in hypercube.