Routing algorithm of folded multistage optical interconnection network

2012 ◽  
Author(s):  
Junbo Yang ◽  
Honghui Jia
Keyword(s):  
Interconnection Network ◽  
Routing Algorithm ◽  
Optical Interconnection

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.

Design of a two-layer optical interconnection network with a routing node

2005 ◽  
Author(s):  
Fanmin Kong ◽  
Wencai Jing ◽  
Yimo Zhang ◽  
Feng Tang ◽  
Zhixiang Sun
Keyword(s):  
Interconnection Network ◽  
Optical Interconnection

An optical interconnection network for terabit IP routers

2000 ◽  
Vol 18 (12) ◽  
pp. 2095-2112 ◽  
Author(s):  
H.J. Chao ◽  
Ti-Shiang Wang
Keyword(s):  
Interconnection Network ◽  
Optical Interconnection ◽  
Ip Routers

Optical Matrix Computing of Rearrangeable Optical Interconnection Network in Free Space

2010 ◽  
Vol 37 (7) ◽  
pp. 1762-1771
Author(s):  
杨俊波 Yang Junbo ◽  
李修建 Li Xiujian ◽  
杨建坤 Yang Jiankun ◽  
刘菊 Liu Ju ◽  
苏显渝 Su Xianyu ◽  
...  
Keyword(s):  
Free Space ◽  
Interconnection Network ◽  
Optical Interconnection

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.

Sign in / Sign up

Export Citation Format

Share Document