# A Hypercube-based Scalable Interconnection Network for Massively Parallel Computing

@article{Liu2008AHS, title={A Hypercube-based Scalable Interconnection Network for Massively Parallel Computing}, author={Youyao Liu and Jungang Han and Huimin Du}, journal={J. Comput.}, year={2008}, volume={3}, pages={58-65} }

An important issues in the design of interconnection networks for massively parallel computers is scalability. [...] Key Method The nodes of the DLH network adopt the hybrid coding combining Johnson code and Gray code. The hybrid coding scheme can make routing algorithms simple and efficient. Both unicasting and broadcasting routing algorithms are designed for the DLH network, and it is based on the hybrid coding scheme. A detailed analysis shows that the DLH network is a better interconnection network in theā¦ Expand

#### 25 Citations

Topology Architecture and Routing Algorithms of Octagon-Connected Torus Interconnection Network

- Computer Science
- 2015

A detailed analysis shows that the octagon-connected torus network is a better interconnection network in the properties of topology and the performance of communication. Expand

Linear Crossed Cube (LCQ): A New Interconnection Network Topology for Massively Parallel System

- Computer Science
- 2015

The comparative simulation study shows that the proposed network can be considered as low-cost multiprocessor architecture for parallel system when appropriate scheduling algorithm is implemented onto it. Expand

Data Transmit in Communication with Multiprocessor Interconnection: Literature Review

- Computer Science
- 2015

This paper explore direct network architectures are strong entrant for use in many successful profitable, experimental multicomputers and scalable shared memory multiprocessors, and a combination of topology and hypercube. Expand

x-Folded TM: An efficient topology for interconnection networks

- Computer Science
- J. Netw. Comput. Appl.
- 2016

This paper presents a novel topology called x-Folded TM, which is a TM topology that is folded according to the x-axis that is similar to that of most torus networks and better than that of some toru networks. Expand

Embedding Interconnection Networks in Crossed Cubes

- Computer Science
- 2010

This chapter shows the ability of the crossed cube as a versatile architecture to simulate other interconnection networks efficiently and presents new schemes to embed complete binary trees, complete quad trees, and cycles into crossed cubes. Expand

An Optimum Value of Dynamic Communication Performance for Midimew Connected Mesh Network

- Computer Science
- 2016

This study has evaluated a dynamic communication performance of a variety of MMN using the TOPAZ simulator using a deadlock free routing algorithm with uniform traffic patterns, whereby the dimension order routing and virtual cut-through flow control are used. Expand

An efficient hypercube labeling schema for dynamic Peer-to-Peer networks

- Computer Science
- J. Parallel Distributed Comput.
- 2017

A new labeling scheme is developed which assigns identifiers (labels) to each node and then uses these labels to determine inter-node distances as is done in a hypercube, thus eliminating the need to send out queries to find the distance from one node to another. Expand

Structural Properties of Torus-Butterfly Interconnection Network

- Computer Science
- 2012

It is proved that the structural properties such as network diameter and node degree of the Torus-Butterfly inter connection networks is more scalable than other interconnection networks. Expand

Towards understanding optimal MIMD queueless routing of arbitrary permutations on hypercubes

- Computer Science
- The Journal of Supercomputing
- 2011

This paper addresses the problem of the offline routing of arbitrary permutations on hypercubes under the MIMD queueless communication constraints which imposes that only one message can be located in each node of the hypercube right through the routing, and revisit the problem through the k-partitioning paradigm based on maximum matching of bipartite graphs concept to take advantage of the recursive structure of thehypercube topology. Expand

Adaptive routing algorithm in x-Folded TM topology

- Computer Science
- 2016 IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE)
- 2016

The effectiveness of the x-Folded TM network with the average latency and network throughput under the adaptive routing algorithm to improve dynamic communication performance is presented. Expand

#### References

SHOWING 1-10 OF 26 REFERENCES

Scalable optical hypercube-based interconnection network for massively parallel computing.

- Computer Science, Medicine
- Applied optics
- 1994

A new modular optical interconnection network, called an optical multimesh hypercube (OMMH), which is both size and time scalable and intended to exploit the advantages of both space-invariant free-space and multiwavelength fiber-based optical interconnect technologies. Expand

A Spanning Multichannel Linked Hypercube: A Gradually Scalable Optical Interconnection Network for Massively Parallel Computing

- Computer Science
- IEEE Trans. Parallel Distributed Syst.
- 1998

A new, scalable interconnection topology called the Spanning Multichannel Linked Hypercube (SMLH) is proposed. This proposed network is very suitable to massively parallel systems and is highlyā¦ Expand

The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems

- Computer Science
- IEEE Trans. Parallel Distributed Syst.
- 1994

A wide class of problems, the divide & conquer class (D&Q), is shown to be easily and efficiently solvable on the HHC topology, and parallel algorithms are provided to describe how a D&Q problem can be solved efficiently on an HHC structure. Expand

Gaussian Networks for Scalable Distributed Systems

- Computer Science
- Comput. J.
- 1996

By extending the popular hypercube, a family of parameterized network topologies called Gaussian Cubes (GCs) is presented and it is demonstrated that these new networks can approximate the concurrency offered by hypercubes while lowering the cost of interconnection. Expand

RH: A Versatile Family of Reduced Hypercube Interconnection Networks

- Computer Science
- IEEE Trans. Parallel Distributed Syst.
- 1994

This short note proposes a new topology that is produced from the hypercube by a uniform reduction in the number of edges for each node, which produces networks with lower complexity than hypercubes while maintaining, to a high extent, the powerful hypercube properties. Expand

dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout

- Computer Science
- IEEE Trans. Parallel Distributed Syst.
- 1993

A class of hierarchical networks that is suitable for implementation of large multi-computers in VLSI with wafer scale integration (VLSI/WSI) technology is introduced, which employ the hypercube topology as a basic cluster, connect many of these clusters using a de Bruijn graph, and maintain the node connectivity to be the same for all nodes product graph. Expand

Node-disjoint paths in hierarchical hypercube networks

- Computer Science
- Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
- 2006

A maximal number of node-disjoint paths are constructed between every two distinct nodes of the hierarchical hypercube network, suitable for massively parallel systems. Expand

Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes

- Computer Science
- IEEE Trans. Parallel Distributed Syst.
- 1992

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 class of highly parallel algorithms. Expand

Hierarchical Cubic Networks

- Computer Science
- IEEE Trans. Parallel Distributed Syst.
- 1995

Simulation of uniform and localized traffic patterns reveal that the normalized average internode distances in a HCN are better than in a comparable hypercube, a fact that has positive ramifications on the implementation of HCN-connected systems. Expand

Efficient implementation methodology for three-dimensional space-invariant hypercube-based optical interconnection networks.

- Computer Science, Medicine
- Applied optics
- 1993

It is shown that the proposed methodology greatly improves area utilization as compared with previous methods, and indicates that two-dimensional arrays of 512 Ć 512 nodes interconnected in a hypercube (18-cube) topology could be implemented. Expand