An Adaptive Routing of the 2-D Torus Network Based on Turn Model

Miura, Yasuyuki; Shimozono, Kentaro; Watanabe, Soichi; Matoyama, Kazuya

doi:10.1109/candar.2013.105

Cited by 14 publications

(11 citation statements)

References 7 publications

(7 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, three restrictions are put on eight turns, specifically, right → upper, left → upper, and right → lower. This algorithm was named restricted North First (rNF) [20].…”

Section: North-south First Routingmentioning

confidence: 99%

“…But the improvement of performance was not obtained in this method. So we proposed to combine the South First (SF) method to rNF [20]. This method was named the North-South First (NSF) routing (SF is adaptive routing algorithms based on turn model).…”

Section: Introductionmentioning

confidence: 99%

“…In [20], we presented the NSF Routing algorithm and evaluated its dynamic performance in a software simulation of two communication patterns. The simulation, however, only compared the NSF method with the conventional deterministic routing (its name is Dimension Order Routing, DOR) on a 2-D torus.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Adaptive Routing Algorithm of 2-D Torus Network Based on Turn Model: The Communication Performance

Miura

Shimozono

Fukase

et al. 2015

IJNC

Self Cite

View full text Add to dashboard Cite

A 2-D torus network is one of the most popular networks for parallel processing. Many algorithms have been proposed based on the turn model, but most of them cannot be applied to a torus network without modification. In this paper, we propose North-South First (NSF) routing that is applicable to a 2-D torus and combines the north-first method (NF) and the south-first method (SF). NF and SF are algorithms yielded by the turn model. A software simulation comparing NSF routing with other forms of deterministic and adaptive routing showed that NSF routing improves throughput in three types of communication patterns, but yields no improvement for one other communication pattern.

show abstract

“…Here, three restrictions are put on eight turns, specifically, right → upper, left → upper, and right → lower. This algorithm was named restricted North First (rNF) [20].…”

Section: North-south First Routingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Adaptive Routing Algorithm of 2-D Torus Network Based on Turn Model: The Communication Performance

Miura

Shimozono

Fukase

et al. 2015

IJNC

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, most of these algorithms cannot be applied to torus networks without change. If an adaptive routing algorithm for a torus network could be realized by modifying the turn model, it would be possible to realize adaptive routing without having to install additional virtual channels [18].We have previously proposed the North-South First (NSF) algorithm, which is the combination of North First and South First algorithms [19][20][21][22][23]. Since up to now we focused on the proposal of a routing algorithm aimed at avoiding congestion of the interconnection network, the fault tolerance of the NSF algorithm was not sufficient.We improved the NSF algorithms and propose an improved North-South First method (NSF-IP, NSF-ImProved), which is a fault-tolerant routing algorithm.…”

mentioning

confidence: 99%

“…We have previously proposed the North-South First (NSF) algorithm, which is the combination of North First and South First algorithms [19][20][21][22][23]. Since up to now we focused on the proposal of a routing algorithm aimed at avoiding congestion of the interconnection network, the fault tolerance of the NSF algorithm was not sufficient.…”

mentioning

confidence: 99%

Fault-Tolerant Adaptive Routing Algorithm for 2D Torus Network

Miura

Nakao

Fukase

2019

TNC

View full text Add to dashboard Cite

A 2D torus network is one of the most popular networks for parallel processing. We have researched the North-South First (NSF) routing which is applicable to a 2D torus and combines the north-first (NF) and south-first (SF) methods. We focused on the proposal of a routing algorithm aimed at avoiding congestion of the crowded network. It was superior in congestion tolerance but not in fault tolerance. We have therefore been researching algorithms considering fault tolerance of the NSF method. In this paper we propose an NSF-FT method which is a new routing algorithm with improved fault tolerance. We evaluated the congestion resistance and fault tolerance of the proposed method by dynamic communication performance evaluation by simulation. The software simulation showed that the proposed algorithm has higher performance.A number of adaptive routing algorithms based on the turn model [14-17] do not need additional virtual channels. However, most of these algorithms cannot be applied to torus networks without change. If an adaptive routing algorithm for a torus network could be realized by modifying the turn model, it would be possible to realize adaptive routing without having to install additional virtual channels [18].We have previously proposed the North-South First (NSF) algorithm, which is the combination of North First and South First algorithms [19][20][21][22][23]. Since up to now we focused on the proposal of a routing algorithm aimed at avoiding congestion of the interconnection network, the fault tolerance of the NSF algorithm was not sufficient.We improved the NSF algorithms and propose an improved North-South First method (NSF-IP, NSF-ImProved), which is a fault-tolerant routing algorithm. And we evaluated both its congestion resistance and its fault tolerance in dynamic communication performance by simulation [23]. However, the fault tolerance of NSF-IP is not enough [23]. It is thought that the fault tolerance can be by changing the routing policy when a packet arrives at a faulty PE.In this paper we propose the NSF-FT (NSF-Fault-Tolerant) algorithm to improve the fault tolerance by improving the NSF-IP algorithm. We evaluate its congestion resistance and fault tolerance by software simulation. 2D Torus NetworkThe structure of a 2D torus network is shown in Figure 1. The network has an N×N two-dimensional structure, and its four edges are connected by wraparound links. It is used in many parallel computers and some interconnection networks. Figure 1: Structure of a 2D-torus network.Dimension-order routing (DOR) is generally used for deterministic routing on a 2D torus. In DOR, the packet moves on channels in the y direction before moving in the x direction. To avoid deadlocks on a 2D torus, DOR needs two virtual channels (channel-L and channel-H).  Choose channel-L when starting routing in the y direction.  When the head of the packet passes through a wraparound link, move the packet to channel-H.  When the routing in the y direction is completed, move the packet in the x direction; use channel-L r...

show abstract

3D-TTN: a power efficient cost effective high performance hierarchical interconnection network for next generation green supercomputer

Faisal¹,

Rahman

Inoguchi

2021

Cluster Comput

View full text Add to dashboard Cite

Green computing is an important factor to ensure the eco-friendly use of computers and their resources. Electric power used in a computer converts into heat and thus, the system takes fewer watts ensuring less cooling. This lower energy consumption allows to be less costly to run as well as reduces the environmental impact of powering the computer. One of the most challenging problems for the modern green supercomputers is the reduction of current power consumptions. Consequently, regular conventional interconnection networks also show poor cost performance. On the other hand, hierarchical interconnection networks (like-3D-TTN) can be a possible solution to those issues. The main focus for this paper is the estimation of power usage at the on-chip level for 3D-TTN with the various other networks along with the analysis of static network performance. In our analysis, 3D-TTN requires about 32.48% less router power usage at the on-chip level and can also achieve near about 21% better diameter performance as well as 12% better average distance performance than the 5D-Torus network. Similarly, it also requires only about 14.43% higher router power usage; however, can achieve 23.21% better diameter performance and 26.3% better average distance than recent hierarchical interconnection network- 3D-TESH. The most attractive feature of this paper is the static hop distance parameter and per watt analysis (power-performance). According to our power-performance results, 3D-TTN can also show better result than the 3D-Mesh, 2D-Mesh, 2D-Torus and 3D-TESH network even at the lowest network level. Moreover, this paper is also featured with the static effectiveness analysis, which ensures cost and time efficiency of 3D-TTN.

show abstract

An Adaptive Routing of the 2-D Torus Network Based on Turn Model

Cited by 14 publications

References 7 publications

An Adaptive Routing Algorithm of 2-D Torus Network Based on Turn Model: The Communication Performance

An Adaptive Routing Algorithm of 2-D Torus Network Based on Turn Model: The Communication Performance

Fault-Tolerant Adaptive Routing Algorithm for 2D Torus Network

3D-TTN: a power efficient cost effective high performance hierarchical interconnection network for next generation green supercomputer

Contact Info

Product

Resources

About