A generalized theory based on the turn model for deadlock-free irregular networks

Ryuta Kawano, Ryota Yasudo, Hiroki Matsutani, Michihiro Koibuchi, Hideharu Amano

Research output: Contribution to journalArticle

Abstract

Recently proposed irregular networks can reduce the latency for both on-chip and off-chip systems with a large number of computing nodes and thus can improve the performance of parallel applications. However, these networks usually suffer from deadlocks in routing packets when using a naive minimal path routing algorithm. To solve this problem, we focus attention on a lately proposed theory that generalizes the turn model to maintain the network performance with deadlock-freedom. The theorems remain a challenge of applying themselves to arbitrary topologies including fully irregular networks. In this paper, we advance the theorems to completely general ones. Moreover, we provide a feasible implementation of a deadlock-free routing method based on our advanced theorem. Experimental results show that the routing method based on our proposed theorem can improve the network throughput by up to 138 % compared to a conventional deterministic minimal routing method. Moreover, when utilized as the escape path in Duato’s protocol, it can improve the throughput by up to 26.3 % compared with the conventional up*/down* routing.

Original languageEnglish
Pages (from-to)101-110
Number of pages10
JournalIEICE Transactions on Information and Systems
VolumeE103D
Issue number1
DOIs
Publication statusPublished - 2020 Jan 1

Fingerprint

Throughput
Routing algorithms
Network performance
Topology

Keywords

  • Deadlock-free routing algorithm
  • High performance computing
  • Interconnection networks
  • Irregular networks
  • Virtual channels

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

A generalized theory based on the turn model for deadlock-free irregular networks. / Kawano, Ryuta; Yasudo, Ryota; Matsutani, Hiroki; Koibuchi, Michihiro; Amano, Hideharu.

In: IEICE Transactions on Information and Systems, Vol. E103D, No. 1, 01.01.2020, p. 101-110.

Research output: Contribution to journalArticle

@article{9cf430dd29e64f3a9e6446f0792f3c9d,
title = "A generalized theory based on the turn model for deadlock-free irregular networks",
abstract = "Recently proposed irregular networks can reduce the latency for both on-chip and off-chip systems with a large number of computing nodes and thus can improve the performance of parallel applications. However, these networks usually suffer from deadlocks in routing packets when using a naive minimal path routing algorithm. To solve this problem, we focus attention on a lately proposed theory that generalizes the turn model to maintain the network performance with deadlock-freedom. The theorems remain a challenge of applying themselves to arbitrary topologies including fully irregular networks. In this paper, we advance the theorems to completely general ones. Moreover, we provide a feasible implementation of a deadlock-free routing method based on our advanced theorem. Experimental results show that the routing method based on our proposed theorem can improve the network throughput by up to 138 {\%} compared to a conventional deterministic minimal routing method. Moreover, when utilized as the escape path in Duato’s protocol, it can improve the throughput by up to 26.3 {\%} compared with the conventional up*/down* routing.",
keywords = "Deadlock-free routing algorithm, High performance computing, Interconnection networks, Irregular networks, Virtual channels",
author = "Ryuta Kawano and Ryota Yasudo and Hiroki Matsutani and Michihiro Koibuchi and Hideharu Amano",
year = "2020",
month = "1",
day = "1",
doi = "10.1587/transinf.2018EDP7367",
language = "English",
volume = "E103D",
pages = "101--110",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "1",

}

TY - JOUR

T1 - A generalized theory based on the turn model for deadlock-free irregular networks

AU - Kawano, Ryuta

AU - Yasudo, Ryota

AU - Matsutani, Hiroki

AU - Koibuchi, Michihiro

AU - Amano, Hideharu

PY - 2020/1/1

Y1 - 2020/1/1

N2 - Recently proposed irregular networks can reduce the latency for both on-chip and off-chip systems with a large number of computing nodes and thus can improve the performance of parallel applications. However, these networks usually suffer from deadlocks in routing packets when using a naive minimal path routing algorithm. To solve this problem, we focus attention on a lately proposed theory that generalizes the turn model to maintain the network performance with deadlock-freedom. The theorems remain a challenge of applying themselves to arbitrary topologies including fully irregular networks. In this paper, we advance the theorems to completely general ones. Moreover, we provide a feasible implementation of a deadlock-free routing method based on our advanced theorem. Experimental results show that the routing method based on our proposed theorem can improve the network throughput by up to 138 % compared to a conventional deterministic minimal routing method. Moreover, when utilized as the escape path in Duato’s protocol, it can improve the throughput by up to 26.3 % compared with the conventional up*/down* routing.

AB - Recently proposed irregular networks can reduce the latency for both on-chip and off-chip systems with a large number of computing nodes and thus can improve the performance of parallel applications. However, these networks usually suffer from deadlocks in routing packets when using a naive minimal path routing algorithm. To solve this problem, we focus attention on a lately proposed theory that generalizes the turn model to maintain the network performance with deadlock-freedom. The theorems remain a challenge of applying themselves to arbitrary topologies including fully irregular networks. In this paper, we advance the theorems to completely general ones. Moreover, we provide a feasible implementation of a deadlock-free routing method based on our advanced theorem. Experimental results show that the routing method based on our proposed theorem can improve the network throughput by up to 138 % compared to a conventional deterministic minimal routing method. Moreover, when utilized as the escape path in Duato’s protocol, it can improve the throughput by up to 26.3 % compared with the conventional up*/down* routing.

KW - Deadlock-free routing algorithm

KW - High performance computing

KW - Interconnection networks

KW - Irregular networks

KW - Virtual channels

UR - http://www.scopus.com/inward/record.url?scp=85077451293&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85077451293&partnerID=8YFLogxK

U2 - 10.1587/transinf.2018EDP7367

DO - 10.1587/transinf.2018EDP7367

M3 - Article

AN - SCOPUS:85077451293

VL - E103D

SP - 101

EP - 110

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 1

ER -