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

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

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.

本文言語	English
ホスト出版物のタイトル	IEEE CITS 2017 - 2017 International Conference on Computer, Information and Telecommunication Systems
出版社	Institute of Electrical and Electronics Engineers Inc.
ページ	229-233
ページ数	5
ISBN（電子版）	9781509059560
DOI	https://doi.org/10.1109/CITS.2017.8035332
出版ステータス	Published - 2017 9月 12
イベント	6th International Conference on Computer, Information and Telecommunication Systems, CITS 2017 - Dalian, China 継続期間: 2017 7月 21 → 2017 7月 23

Other

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

ASJC Scopus subject areas

ハードウェアとアーキテクチャ
情報システム
コンピュータネットワークおよび通信

文献へのアクセス

10.1109/CITS.2017.8035332

他のファイルとリンク

引用スタイル

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

抄録

Other

ASJC Scopus subject areas

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル