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

Jindun Dai; Renjie Li; Xin Jiang; Takahiro Watanabe

doi:10.1109/TENCON.2017.8227901

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

Jindun Dai^*, Renjie Li, Xin Jiang, Takahiro Watanabe

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	TENCON 2017 - 2017 IEEE Region 10 Conference
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	421-426
Number of pages	6
ISBN (Electronic)	9781509011339
DOIs	https://doi.org/10.1109/TENCON.2017.8227901
Publication status	Published - 2017 Dec 19
Externally published	Yes
Event	2017 IEEE Region 10 Conference, TENCON 2017 - Penang, Malaysia Duration: 2017 Nov 5 → 2017 Nov 8

Publication series

Name	IEEE Region 10 Annual International Conference, Proceedings/TENCON
Volume	2017-December
ISSN (Print)	2159-3442
ISSN (Electronic)	2159-3450

Other

Other	2017 IEEE Region 10 Conference, TENCON 2017
Country/Territory	Malaysia
City	Penang
Period	17/11/5 → 17/11/8

ASJC Scopus subject areas

Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/TENCON.2017.8227901

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 (pp. 421-426). (IEEE Region 10 Annual International Conference, Proceedings/TENCON; Vol. 2017-December). 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 et al.
TENCON 2017 - 2017 IEEE Region 10 Conference. Institute of Electrical and Electronics Engineers Inc., 2017. p. 421-426 (IEEE Region 10 Annual International Conference, Proceedings/TENCON; Vol. 2017-December).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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. IEEE Region 10 Annual International Conference, Proceedings/TENCON, 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

@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",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE Region 10 Conference, TENCON 2017 ; Conference date: 05-11-2017 Through 08-11-2017",

year = "2017",

month = dec,

day = "19",

doi = "10.1109/TENCON.2017.8227901",

language = "English",

series = "IEEE Region 10 Annual International Conference, Proceedings/TENCON",

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

pages = "421--426",

booktitle = "TENCON 2017 - 2017 IEEE Region 10 Conference",

}

TY - GEN

T1 - PWSF

T2 - 2017 IEEE Region 10 Conference, TENCON 2017

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

AN - SCOPUS:85044229282

T3 - IEEE Region 10 Annual International Conference, Proceedings/TENCON

SP - 421

EP - 426

BT - TENCON 2017 - 2017 IEEE Region 10 Conference

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 5 November 2017 through 8 November 2017

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this