PWSF

Planar-west-South-first routing algorithm for 3D Network-on-Chip

Jindun Dai, Renjie Li, Xin Jiang, Takahiro Watanabe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

As an efficient multi-core system structure, three-dimensional Network-on-Chips (3D NoC) opened a new filed of System-on-Chip (SoC) research. In this paper, we present an efficient routing algorithm for 3D NoC applications. This method is based on west-south-first routing algorithm and intra-layer routing has higher priority. We introduce the concept of possible deadlocked configurations and further loosen the sufficient condition of deadlock freeness in adaptive routing. By using channel dependency graph, the proposed method is proven to be free from deadlock. Furthermore, the proposed method can balance channel loads and reduce uneven adaptiveness effectively. Simulation experiments verify the theoretical analyses on adaptiveness and demonstrate routing effectiveness.

Original languageEnglish
Title of host publicationTENCON 2017 - 2017 IEEE Region 10 Conference
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages421-426
Number of pages6
Volume2017-December
ISBN (Electronic)9781509011339
DOIs
Publication statusPublished - 2017 Dec 19
Event2017 IEEE Region 10 Conference, TENCON 2017 - Penang, Malaysia
Duration: 2017 Nov 52017 Nov 8

Other

Other2017 IEEE Region 10 Conference, TENCON 2017
CountryMalaysia
CityPenang
Period17/11/517/11/8

Fingerprint

Routing algorithms
Network-on-chip
Experiments

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Dai, J., Li, R., Jiang, X., & Watanabe, T. (2017). PWSF: Planar-west-South-first routing algorithm for 3D Network-on-Chip. In TENCON 2017 - 2017 IEEE Region 10 Conference (Vol. 2017-December, pp. 421-426). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/TENCON.2017.8227901

PWSF : Planar-west-South-first routing algorithm for 3D Network-on-Chip. / Dai, Jindun; Li, Renjie; Jiang, Xin; Watanabe, Takahiro.

TENCON 2017 - 2017 IEEE Region 10 Conference. Vol. 2017-December Institute of Electrical and Electronics Engineers Inc., 2017. p. 421-426.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dai, J, Li, R, Jiang, X & Watanabe, T 2017, PWSF: Planar-west-South-first routing algorithm for 3D Network-on-Chip. in TENCON 2017 - 2017 IEEE Region 10 Conference. vol. 2017-December, Institute of Electrical and Electronics Engineers Inc., pp. 421-426, 2017 IEEE Region 10 Conference, TENCON 2017, Penang, Malaysia, 17/11/5. https://doi.org/10.1109/TENCON.2017.8227901
Dai J, Li R, Jiang X, Watanabe T. PWSF: Planar-west-South-first routing algorithm for 3D Network-on-Chip. In TENCON 2017 - 2017 IEEE Region 10 Conference. Vol. 2017-December. Institute of Electrical and Electronics Engineers Inc. 2017. p. 421-426 https://doi.org/10.1109/TENCON.2017.8227901
Dai, Jindun ; Li, Renjie ; Jiang, Xin ; Watanabe, Takahiro. / PWSF : Planar-west-South-first routing algorithm for 3D Network-on-Chip. TENCON 2017 - 2017 IEEE Region 10 Conference. Vol. 2017-December Institute of Electrical and Electronics Engineers Inc., 2017. pp. 421-426
@inproceedings{dd530b33b75b4bf39cf2a83f81175024,
title = "PWSF: Planar-west-South-first routing algorithm for 3D Network-on-Chip",
abstract = "As an efficient multi-core system structure, three-dimensional Network-on-Chips (3D NoC) opened a new filed of System-on-Chip (SoC) research. In this paper, we present an efficient routing algorithm for 3D NoC applications. This method is based on west-south-first routing algorithm and intra-layer routing has higher priority. We introduce the concept of possible deadlocked configurations and further loosen the sufficient condition of deadlock freeness in adaptive routing. By using channel dependency graph, the proposed method is proven to be free from deadlock. Furthermore, the proposed method can balance channel loads and reduce uneven adaptiveness effectively. Simulation experiments verify the theoretical analyses on adaptiveness and demonstrate routing effectiveness.",
author = "Jindun Dai and Renjie Li and Xin Jiang and Takahiro Watanabe",
year = "2017",
month = "12",
day = "19",
doi = "10.1109/TENCON.2017.8227901",
language = "English",
volume = "2017-December",
pages = "421--426",
booktitle = "TENCON 2017 - 2017 IEEE Region 10 Conference",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - PWSF

T2 - Planar-west-South-first routing algorithm for 3D Network-on-Chip

AU - Dai, Jindun

AU - Li, Renjie

AU - Jiang, Xin

AU - Watanabe, Takahiro

PY - 2017/12/19

Y1 - 2017/12/19

N2 - As an efficient multi-core system structure, three-dimensional Network-on-Chips (3D NoC) opened a new filed of System-on-Chip (SoC) research. In this paper, we present an efficient routing algorithm for 3D NoC applications. This method is based on west-south-first routing algorithm and intra-layer routing has higher priority. We introduce the concept of possible deadlocked configurations and further loosen the sufficient condition of deadlock freeness in adaptive routing. By using channel dependency graph, the proposed method is proven to be free from deadlock. Furthermore, the proposed method can balance channel loads and reduce uneven adaptiveness effectively. Simulation experiments verify the theoretical analyses on adaptiveness and demonstrate routing effectiveness.

AB - As an efficient multi-core system structure, three-dimensional Network-on-Chips (3D NoC) opened a new filed of System-on-Chip (SoC) research. In this paper, we present an efficient routing algorithm for 3D NoC applications. This method is based on west-south-first routing algorithm and intra-layer routing has higher priority. We introduce the concept of possible deadlocked configurations and further loosen the sufficient condition of deadlock freeness in adaptive routing. By using channel dependency graph, the proposed method is proven to be free from deadlock. Furthermore, the proposed method can balance channel loads and reduce uneven adaptiveness effectively. Simulation experiments verify the theoretical analyses on adaptiveness and demonstrate routing effectiveness.

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

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

U2 - 10.1109/TENCON.2017.8227901

DO - 10.1109/TENCON.2017.8227901

M3 - Conference contribution

VL - 2017-December

SP - 421

EP - 426

BT - TENCON 2017 - 2017 IEEE Region 10 Conference

PB - Institute of Electrical and Electronics Engineers Inc.

ER -