Crosstalk Free Routing Algorithm for High Speed Optical Multistage Interconnection Network

2019 ◽  
Vol 28 (1) ◽  
pp. 121-136
Author(s):  
Abd El-Naser Mohammed ◽  
Ahmed El-Eraki ◽  
Marwa Azar
Keyword(s):  
High Speed ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Multistage Interconnection Network

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.

ANALYSIS OF A HIGH-SPEED INTERCONNECTION NETWORK

2002 ◽  
Vol 03 (01n02) ◽  
pp. 49-65 ◽  
Author(s):  
NADER F. MIR
Keyword(s):  
Interconnection Networks ◽  
High Speed ◽  
Interconnection Network ◽  
Shortest Paths ◽  
Switching Network ◽  
Contention Resolution ◽  
Banyan Network ◽  
Switch Element ◽  
Local Controller ◽  
Special Arrangement

A thorough routing analysis of a switching network called the spherical switching network for high-speed applications is presented in this paper. The spherical switching network has a cyclic, regular, and highly expandable structure with a simple self-routing scheme. The network is constructed with fixed-size switch elements regardless of the size of the network. Each switch element consists of a carefully-selected sized 9 input/output crossbar and a local controller. One of the nine pairs of links is external and carries the external traffic, and the other eight pairs are internal. The contention resolution in each switch element is based on deflection of losing packets and incremental priority of packets. The switch elements do not utilize any buffering within the network. The analysis shows that this network clearly outperforms typical interconnection networks currently being deployed in practical switches and routers such as Banyan network. In order to keep the number of deflections low, each incoming external link is connected to a buffer with flow control capabilities. Due to the special arrangement of interconnections in the network, a much larger number of shortest paths between each pair of source/destination exists. The related analysis for finding the number of hops and shortest paths appear in this paper.

scholarly journals Design and Implementation of Rearrangable Non-Blocking Switching Network in VLSI

2019 ◽  
Vol 8 (2S11) ◽  
pp. 2858-2863
Keyword(s):  
Interconnection Network ◽  
The Other ◽  
Switching Network ◽  
Low Latency ◽  
Multistage Interconnection Network ◽  
Design And Implementation ◽  
Benes Network ◽  
Benes Networks

The main goal of this article is to implement an effective Non-Blocking Benes switching Network. Benes Switching Network is designed with the uncomplicated switch modules & it’s have so many advantages, small latency, less traffic and it’s required number of switch modules. Clos and Benes networks are play a key role in the class of multistage interconnection network because of their extensibility and mortality. Benes network provides a low latency when compare with the other networks. 8x8 Benes non blocking switching network is designed and synthesized with the using of Xilinx tool 12.1.

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.

Sign in / Sign up

Export Citation Format

Share Document