An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network in honor of Frank k. Hwang's 65th Birthday

2006 ◽  
Vol 10 (4) ◽  
pp. 296-298 ◽  
Author(s):  
Chiuyuan Chen ◽  
Jing-Kai Lou
Keyword(s):  
Routing Algorithm ◽  
65Th Birthday ◽  
Exchange Network ◽  
Shuffle Exchange Network

EFFICIENT ROUTING ALGORITHMS FOR GENERALIZED SHUFFLE-EXCHANGE NETWORKS

2009 ◽  
Vol 01 (02) ◽  
pp. 267-281 ◽  
Author(s):  
JAMES K. LAN ◽  
WELL Y. CHOU ◽  
CHIUYUAN CHEN
Keyword(s):  
Explicit Formula ◽  
Interconnection Networks ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Multistage Interconnection Networks ◽  
Exchange Networks ◽  
Routing Table ◽  
Computation Process ◽  
Exchange Network ◽  
Shuffle Exchange Network

The shuffle-exchange network has been proposed as a popular architecture for multistage interconnection networks. In 1991, Padmanabhan introduced the generalized shuffle-exchange network (GSEN) and proposed an efficient routing algorithm. Later, Chen et al. further enhanced the GSEN with bidirectional links and proposed the bidirectional GSEN (BGSEN). A BGSEN consists of the forward and the backward network. Based on the idea of inversely using the control tag generated by Padmanabhan's algorithm, Chen et al. proposed a routing algorithm for the backward network. Recently, Chen and Lou also proposed a routing algorithm for the backward network. It should be noted, however, that Padmanabhan's algorithm is actually an explicit formula for computing the control tag for routing and takes only O(1) time. Neither the algorithm of Chen et al. nor the algorithm of Chen and Lou provides an explicit formula for computing the control tag for routing and both algorithms take at least Ω(n) time, where n + 1 is the number of stages in the BGSEN. This paper attempts to propose an explicit formula for computing the control tag for routing in the backward network. We will demonstrate how this formula greatly simplifies the computation process and how it leads to efficient routing algorithms. In particular, an O(1)-time one-to-one routing algorithm and an efficient routing-table construction algorithm have been proposed.

scholarly journals A Modified Diagonal Mesh Shuffle Exchange Interconnection Network

2017 ◽  
Vol 7 (2) ◽  
pp. 1042
Author(s):  
Akash Punhani ◽  
Pardeep Kumar ◽  
Nitin Nitin
Keyword(s):  
Interconnection Network ◽  
Average Distance ◽  
Routing Algorithm ◽  
The Other ◽  
Mesh Network ◽  
Traffic Patterns ◽  
Boundary Node ◽  
Exchange Network ◽  
Shuffle Exchange Network ◽  
2D Torus

Interconnection network is an important part of the digital system. The interconnection mainly describes the topology of the network along with the routing algorithm and flow control mechanism. The topology of the network plays an important role on the performance of the system. Mesh interconnection network was the simplest topology, but has the limited bisection bandwidth on the other hand torus and diagonal mesh was having long links. The Modified diagonal mesh network tried to replace the torodial links but was having more average path length so in proposed topology we have tried to improve the average distance using shuffle exchange network over the boundary node. In this paper, we propose the architecture of Modified Diagonal Mesh Shuffle Exchange Interconnection Network. This Modified Diagonal Mesh Shuffle Exchange Interconnection network have been compared with four popular topologies that are simple 2D Mesh, 2D Torus, Diagonal Mesh and Modified Diagonal Mesh Interconnection Network on the four traffic patterns such as Bit Complement traffic, Neighbor traffic, Tornado traffic and Uniform traffic are used for comparisonand performance analysis. We have performed the analysis with a 5% and 10% of hotspot on the Uniform Traffic. The simulation results shows that the proposed topology is performed better on bit complement traffic and can also handle the other traffic up to certain level.

Bidirectional shuffle-exchange network and tag-based routing algorithm

2003 ◽  
Vol 7 (3) ◽  
pp. 121-123 ◽  
Author(s):  
Zhen Chen ◽  
Zeng-Ji Liu ◽  
Zhi-Liang Qiu
Keyword(s):  
Routing Algorithm ◽  
Exchange Network ◽  
Shuffle Exchange Network
Sign in / Sign up

Export Citation Format

Share Document