scholarly journals A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel Computers

2021 ◽  
Vol 11 (22) ◽  
pp. 10798
Author(s):  
M. M. Hafizur Rahman ◽  
Mohammed Al-Naeem ◽  
Mohammed Mustafa Ghowanem ◽  
Eklas Hossain
Keyword(s):  
Packing Density ◽  
Traffic Congestion ◽  
Interconnection Networks ◽  
Network Performance ◽  
Interconnection Network ◽  
Future Generation ◽  
Parallel Computer ◽  
Massively Parallel ◽  
Traffic Density ◽  
Trade Off

From disaster prevention to mitigation, drug analysis to drug design, agriculture to food security, IoT to AI, and big data analysis to knowledge or sentiment mining, a high computation power is a prime necessity at present. As such, massively parallel computer (MPC) systems comprising a large number of nodes are gaining popularity. To interconnect these huge numbers of nodes efficiently, hierarchical interconnection networks are an attractive and feasible option. A Tori-connected flattened butterfly network (TFBN) has been proposed by the authors in a prior work for future generation MPC systems. In the previous study, the static network performance and static cost-effectiveness were evaluated. In this research, a novel trade-off factor named message traffic congestion vs. packing density trade-off factor has been proposed, which characterizes the message congestion in the network and its packing density. The factor is used to statically assess the suitability of the implementation of an interconnection network. The message traffic density, packing density, and new factor have been evaluated for the proposed network and similar competitive networks such as TTN, TESH, 2D-Mesh, 3D-Mesh, 2D-Torus, and 3D-Torus. It has been found that the performance of the TFBN is superior to the other networks.

scholarly journals Trade-Off Considerations in Designing Efficient VLSI Feasible Interconnection Networks

VLSI Design ◽  
1995 ◽  
Vol 2 (4) ◽  
pp. 365-374 ◽  
Author(s):  
S. Q. Zheng ◽  
B. Cong ◽  
S. Bettayeb
Keyword(s):  
Parallel Computation ◽  
Interconnection Networks ◽  
Hybrid Networks ◽  
Massively Parallel ◽  
Star Graph ◽  
Trade Off ◽  
Vlsi Technology ◽  
Massively Parallel Computing ◽  
Better Than ◽  
Simple Combination

It is well known that the hypercube has a rich set of good properties, and consequently it has been recognized an ideal structure for parallel computation. Nevertheless, according to the current VLSI technology, the implementation feasibility of the hypercube remains questionable when the size of the hypercube becomes large. Recent research efforts have been concentrated on finding good alternatives to the hypercube. The star graph was shown having many desirable properties of the hypercube, and in several aspects, the star graph is better than the hypercube. However, we observe that the star graph as a network has several disadvantages, compared with the hypercube. In this paper, we propose a class of new networks, the star-hypercube hybrid networks (or the SH networks). The SH network is a simple combination of both the star graph and the hypercube. This class of networks contains the star graph and the hypercube as subclasses. We show that the SH network is an efficient and versatile network for parallel computation, since it shares properties of both the hypercube and the star graph, and remedies several major disadvantages of the hypercube and the star graph. This class of networks provide more flexibility in choosing the size, degree, number of vertices, degree of fault tolerance, etc. in designing massively parallel computing structures feasible for VLSI implementations.

scholarly journals Topological Properties of Hierarchical Interconnection Networks: A Review and Comparison

2011 ◽  
Vol 2011 ◽  
pp. 1-12 ◽  
Author(s):  
Mostafa Abd-El-Barr ◽  
Turki F. Al-Somani
Keyword(s):  
Packing Density ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Parallel Applications ◽  
Topological Properties ◽  
Remote Communication ◽  
Chip Area ◽  
Network Diameter ◽  
Link Cost

Hierarchical interconnection networks (HINs) provide a framework for designing networks with reduced link cost by taking advantage of the locality of communication that exists in parallel applications. HINs employ multiple levels. Lower-level networks provide local communication while higher-level networks facilitate remote communication. HINs provide fault tolerance in the presence of some faulty nodes and/or links. Existing HINs can be broadly classified into two classes. those that use nodes and/or links replication and those that use standby interface nodes. The first class includes Hierarchical Cubic Networks, Hierarchical Completely Connected Networks, and Triple-based Hierarchical Interconnection Networks. The second HINs class includes Modular Fault-Tolerant Hypercube Networks and Hierarchical Fault-Tolerant Interconnection Network. This paper presents a review and comparison of the topological properties of both classes of HINs. The topological properties considered are network degree, diameter, cost and packing density. The outcome of this study show among all HINs two networks that is, the Root-Folded Heawood (RFH) and the Flooded Heawood (FloH), belonging to the first HIN class provide the best network cost, defined as the product of network diameter and degree. The study also shows that HFCube(n,n)provide the best packing density, that is, the smallest chip area required for VLSI implementation.

EMBEDDING OF FAULT-TOLERANT TREES IN THE JOSEPHUS CUBE

2002 ◽  
Vol 12 (01) ◽  
pp. 3-16
Author(s):  
PETER K. K. LOH ◽  
W. J. HSU
Keyword(s):  
Traffic Congestion ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Single Point ◽  
Research Interest ◽  
Tree Network ◽  
Root Node ◽  
Reliability And Availability

The tree interconnection network lends itself to several suitably structured applications. However, the low connectivity at each node, traffic congestion and single point of failure at the root node reduce reliability and availability. Both the hypertree and X-tree are fault-tolerant variants of the basic tree network and have been the focus of more recent implementation and research interest. In this paper, we consider a recently proposed family of interconnection networks known as the Josephus Cubes and show how hypertrees, X-trees and ringed X-trees of arbitrary height can be near-optimally embedded in this novel interconnection network.

EMBEDDING MESH IN A LARGE FAMILY OF GRAPHS

1992 ◽  
Vol 02 (02n03) ◽  
pp. 149-155 ◽  
Author(s):  
WEN-JING HSU ◽  
CARL V. PAGE
Keyword(s):  
Interconnection Networks ◽  
Nearest Neighbor ◽  
Interconnection Network ◽  
Large Family ◽  
Parallel Computations ◽  
Parallel Computer ◽  
Two Dimensional

It is well known that the nearest-neighbor connections of the mesh (especially the two-dimensional meshes) are very useful in parallel computations. Consequently, it is desirable to show that the graph representing the interconnection network of a parallel computer embeds the mesh. Most existing results of mesh-embedding are only applicable to a single kind of network. Here we demonstrate that a large family of interconnection networks called the generalized Fibonacci cubes all embed the mesh.

Embedding Strategies of Mesh Network into the Exchanged Crossed Cube

2018 ◽  
Vol 18 (02n03) ◽  
pp. 1850011
Author(s):  
XINYANG WANG ◽  
DEYU QI ◽  
NAQIN ZHOU
Keyword(s):  
Interconnection Networks ◽  
Network Performance ◽  
Interconnection Network ◽  
Mesh Network ◽  
Parallel And Distributed Computing ◽  
Distributed Computing Systems ◽  
Computing Systems ◽  
Application Range ◽  
Important Variant ◽  
Crossed Cube

The topology of interconnection networks plays an important role in the performance of parallel and distributed computing systems, and the embeddings of interconnection networks can help adapt their topology features into new interconnection network structures. Being a basic and popular structure, the mesh network has wide application range as the result of some of its topology features. Meanwhile, as an important variant of hypercube, the Exchanged Crossed Cube(ECQ) combines advantages of crossed cube and exchanged hypercube, i.e. the promotion of network performance and the reduce of communication cost. To enlarge the application range of the ECQ, this paper discusses the embedding strategies of Mesh network into ECQ and proposes 4 methods to embed meshes into ECQ. We distinguish these methods by comparing their dilation, expansion, loading and congestion. The comparison result shows that compromise among four of the above parameters has to be made to achieve the improvement of some parameters.

Sign in / Sign up

Export Citation Format

Share Document