An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation

2021 ◽  
pp. 1-18
Author(s):  
Yali Lv ◽  
Cheng-Kuan Lin ◽  
Guijuan Wang
Keyword(s):  
Parallel Computation ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Small Degree ◽  
Parallel System ◽  
Good Balance ◽  
Pmc Model ◽  
Hardware Costs ◽  
Cube Formula ◽  
Interconnect Network

The interconnetion network plays an important role in a parallel system. To avoid the edge number of the interconnect network scaling rapidly with the increase of dimension and achieve a good balance of hardware costs and properties, this paper presents a new interconnection network called exchanged [Formula: see text]-ary [Formula: see text]-cube ([Formula: see text]). Compared with the [Formula: see text]-ary [Formula: see text]-cube structures, [Formula: see text] shows better performance in terms of many metrics such as small degree and fewer links. In this paper, we first introduce the structure of [Formula: see text] and present some properties of [Formula: see text]; then, we propose a routing algorithm and obtain the diameter of [Formula: see text]. Finally, we analyze the diagnosis of [Formula: see text] and give the diagnosibility under PMC model and MM* model.

scholarly journals Level Based Routing Using Dynamic Programming for 2D Mesh

2017 ◽  
Vol 17 (2) ◽  
pp. 73-82 ◽  
Author(s):  
Akash Punhani ◽  
Pardeep Kumar ◽  
Nitin Nitin
Keyword(s):  
Dynamic Programming ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Networks On Chip ◽  
Mesh Topology ◽  
On Chip

Abstract The performance of the interconnection network doesn’t only depend on the topology, but it also depends on the Routing algorithm used. The simplest Routing algorithm for the mesh topology in networks on chip is the XY Routing algorithm. The level based Routing algorithm has been proved to be more efficient than the XY Routing algorithm. In this paper, level based Routing algorithm using the dynamic programming has been proposed. The proposed Routing algorithm proves to be more efficient in the terms of the computation. The proposed Routing algorithm has achieved up to two times bigger speed.

OPTIMUM CONGESTED ROUTING STRATEGY ON TWISTED CUBES

2000 ◽  
Vol 01 (02) ◽  
pp. 115-134 ◽  
Author(s):  
TSENG-KUEI LI ◽  
JIMMY J. M. TAN ◽  
LIH-HSING HSU ◽  
TING-YI SUNG
Keyword(s):  
Shortest Path ◽  
Time Complexity ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Optimum Time ◽  
Shortest Path Routing ◽  
Routing Strategy ◽  
Bisection Width ◽  
Twisted Cube ◽  
Twisted Cubes

Given a shortest path routing algorithm of an interconnection network, the edge congestion is one of the important factors to evaluate the performance of this algorithm. In this paper, we consider the twisted cube, a variation of the hypercube with some better properties, and review the existing shortest path routing algorithm8. We find that its edge congestion under the routing algorithm is high. Then, we propose a new shortest path routing algorithm and show that our algorithm has optimum time complexity O(n) and optimum edge congestion 2n. Moreover, we calculate the bisection width of the twisted cube of dimension n.

THE CUBE-OF-RINGS INTERCONNECTION NETWORK

1998 ◽  
Vol 09 (01) ◽  
pp. 25-37 ◽  
Author(s):  
THOMAS J. CORTINA ◽  
ZHIWEI XU
Keyword(s):  
Graph Theory ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Parallel Computers ◽  
Closed Form Expression ◽  
Form Expression ◽  
Graph Theoretic ◽  
Basic Graph

We present a family of interconnection networks named the Cube-Of-Rings (COR) networks along with their basic graph-theoretic properties. Aspects of group graph theory are used to show the COR networks are symmetric and optimally fault tolerant. We present a closed-form expression of the diameter and optimal one-to-one routing algorithm for any member of the COR family. We also discuss the suitability of the COR networks as the interconnection network of scalable parallel computers.

Connectivity and Nature Diagnosability of Leaf-Sort Graphs

2020 ◽  
Vol 20 (03) ◽  
pp. 2050011
Author(s):  
JUTAO ZHAO ◽  
SHIYING WANG
Keyword(s):  
Interconnection Networks ◽  
Interconnection Network ◽  
Research Topic ◽  
Multiprocessor System ◽  
Important Research ◽  
Edge Connectivity ◽  
Topology Structure ◽  
Pmc Model ◽  
Important Research Topic

The connectivity and diagnosability of a multiprocessor system or an interconnection network is an important research topic. The system and interconnection network has a underlying topology, which usually presented by a graph. As a famous topology structure of interconnection networks, the n-dimensional leaf-sort graph CFn has many good properties. In this paper, we prove that (a) the restricted edge connectivity of CFn (n ≥ 3) is 3n − 5 for odd n and 3n − 6 for even n; (b) CFn (n ≥ 5) is super restricted edge-connected; (c) the nature diagnosability of CFn (n ≥ 4) under the PMC model is 3n − 4 for odd n and 3n − 5 for even n; (d) the nature diagnosability of CFn (n ≥ 5) under the MM* model is 3n − 4 for odd n and 3n − 5 for even n.

scholarly journals Shortest Path Routing Algorithm for Hierarchical Interconnection Network-on-Chip

2015 ◽  
Vol 56 ◽  
pp. 409-414 ◽  
Author(s):  
Omair Inam ◽  
Sharifa Al Khanjari ◽  
Wim Vanderbauwhede
Keyword(s):  
Shortest Path ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Network On Chip ◽  
Shortest Path Routing ◽  
On Chip

A Note on the Nature Diagnosability of Alternating Group Graphs Under the PMC Model and MM* Model

2018 ◽  
Vol 18 (01) ◽  
pp. 1850005 ◽  
Author(s):  
SHIYING WANG ◽  
LINGQI ZHAO
Keyword(s):  
Interconnection Networks ◽  
Interconnection Network ◽  
Alternating Group ◽  
Multiprocessor System ◽  
Multiprocessor Systems ◽  
Free Node ◽  
Pmc Model ◽  
Important Study ◽  
Communication Links ◽  
Alternating Group Graph

Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. No faulty set can contain all the neighbors of any fault-free node in the system, which is called the nature diagnosability of the system. Diagnosability of a multiprocessor system is one important study topic. As a favorable topology structure of interconnection networks, the n-dimensional alternating group graph AGn has many good properties. In this paper, we prove the following. (1) The nature diagnosability of AGn is 4n − 10 for n − 5 under the PMC model and MM* model. (2) The nature diagnosability of the 4-dimensional alternating group graph AG4 under the PMC model is 5. (3) The nature diagnosability of AG4 under the MM* model is 4.

Analysis the Performance of Interconnection Network Topology C2 Torus Based on Two Dimensional Torus

2018 ◽  
Vol 6 (6) ◽  
pp. 169 ◽  
Author(s):  
Prachi Chauhan ◽  
Manish Bhardwaj
Keyword(s):  
Network Topology ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Two Dimensional ◽  
Topological Properties ◽  
Interconnected Network ◽  
Dimensional Torus ◽  
Torus Network

Mesh and Torus are most popular interconnection topologies based on 2D-mesh.Comparison between Mesh and Torus will be considered and new interconnection topology will be proposed to provide better performance. The C2Mesh, is an enhanced mesh interconnected network. This paper enhances the torus network based on the theme of C2Mesh. Topological Properties of new network will be analyzed and implemented by simulation. The new routing Algorithm will be designed for new proposed network (C2Torus). This manuscript performs Comparison between C2Torus and C2Mesh.

Sign in / Sign up

Export Citation Format

Share Document