An adaptive routing algorithm based on network partitioning for 3D Network-on-Chip

Jindun Dai; Xin Jiang; Takahiro Watanabe

doi:10.1109/CITS.2017.8035332

An adaptive routing algorithm based on network partitioning for 3D Network-on-Chip

Jindun Dai, Xin Jiang, Takahiro Watanabe

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Citations (Scopus)

Abstract

This paper presents an efficient routing algorithm for 3D meshes without virtual channels. The proposed routing algorithm is extended from 2D east-first routing algorithm and based on network partitioning. It is proven that the proposed method is free from deadlock. In comparison of previous routing algorithms, the average degree of adaptiveness is higher. This feature contributes to higher communication efficiency. Experimental results show that the proposed method can achieve lower communication latency and higher throughput over other traditional methods.

Original language	English
Title of host publication	IEEE CITS 2017 - 2017 International Conference on Computer, Information and Telecommunication Systems
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	229-233
Number of pages	5
ISBN (Electronic)	9781509059560
DOIs	https://doi.org/10.1109/CITS.2017.8035332
Publication status	Published - 2017 Sept 12
Event	6th International Conference on Computer, Information and Telecommunication Systems, CITS 2017 - Dalian, China Duration: 2017 Jul 21 → 2017 Jul 23

Other

Other	6th International Conference on Computer, Information and Telecommunication Systems, CITS 2017
Country/Territory	China
City	Dalian
Period	17/7/21 → 17/7/23

ASJC Scopus subject areas

Hardware and Architecture
Information Systems
Computer Networks and Communications

Access to Document

10.1109/CITS.2017.8035332

Cite this

An adaptive routing algorithm based on network partitioning for 3D Network-on-Chip. / Dai, Jindun; Jiang, Xin; Watanabe, Takahiro.
IEEE CITS 2017 - 2017 International Conference on Computer, Information and Telecommunication Systems. Institute of Electrical and Electronics Engineers Inc., 2017. p. 229-233 8035332.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Dai, J, Jiang, X & Watanabe, T 2017, An adaptive routing algorithm based on network partitioning for 3D Network-on-Chip. in IEEE CITS 2017 - 2017 International Conference on Computer, Information and Telecommunication Systems., 8035332, Institute of Electrical and Electronics Engineers Inc., pp. 229-233, 6th International Conference on Computer, Information and Telecommunication Systems, CITS 2017, Dalian, China, 17/7/21. https://doi.org/10.1109/CITS.2017.8035332

@inproceedings{ae643216242044f6a2c4b559c1014e1c,

title = "An adaptive routing algorithm based on network partitioning for 3D Network-on-Chip",

abstract = "This paper presents an efficient routing algorithm for 3D meshes without virtual channels. The proposed routing algorithm is extended from 2D east-first routing algorithm and based on network partitioning. It is proven that the proposed method is free from deadlock. In comparison of previous routing algorithms, the average degree of adaptiveness is higher. This feature contributes to higher communication efficiency. Experimental results show that the proposed method can achieve lower communication latency and higher throughput over other traditional methods.",

author = "Jindun Dai and Xin Jiang and Takahiro Watanabe",

year = "2017",

month = sep,

day = "12",

doi = "10.1109/CITS.2017.8035332",

language = "English",

pages = "229--233",

booktitle = "IEEE CITS 2017 - 2017 International Conference on Computer, Information and Telecommunication Systems",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "6th International Conference on Computer, Information and Telecommunication Systems, CITS 2017 ; Conference date: 21-07-2017 Through 23-07-2017",

}

TY - GEN

T1 - An adaptive routing algorithm based on network partitioning for 3D Network-on-Chip

AU - Dai, Jindun

AU - Jiang, Xin

AU - Watanabe, Takahiro

PY - 2017/9/12

Y1 - 2017/9/12

N2 - This paper presents an efficient routing algorithm for 3D meshes without virtual channels. The proposed routing algorithm is extended from 2D east-first routing algorithm and based on network partitioning. It is proven that the proposed method is free from deadlock. In comparison of previous routing algorithms, the average degree of adaptiveness is higher. This feature contributes to higher communication efficiency. Experimental results show that the proposed method can achieve lower communication latency and higher throughput over other traditional methods.

AB - This paper presents an efficient routing algorithm for 3D meshes without virtual channels. The proposed routing algorithm is extended from 2D east-first routing algorithm and based on network partitioning. It is proven that the proposed method is free from deadlock. In comparison of previous routing algorithms, the average degree of adaptiveness is higher. This feature contributes to higher communication efficiency. Experimental results show that the proposed method can achieve lower communication latency and higher throughput over other traditional methods.

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

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

U2 - 10.1109/CITS.2017.8035332

DO - 10.1109/CITS.2017.8035332

M3 - Conference contribution

AN - SCOPUS:85032449548

SP - 229

EP - 233

BT - IEEE CITS 2017 - 2017 International Conference on Computer, Information and Telecommunication Systems

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 6th International Conference on Computer, Information and Telecommunication Systems, CITS 2017

Y2 - 21 July 2017 through 23 July 2017

ER -

An adaptive routing algorithm based on network partitioning for 3D Network-on-Chip

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this