Balanced dimension-order routing for k-ary n-cubes

Jose Miguel Montañana, Michihiro Koibuchi, Hiroki Matsutani, Hideharu Amano

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

7 Citations (Scopus)

Abstract

Current Network-on-Chip (NoC) architectures sometimes employ mesh or torus topology with the dimensionorder routing. In this paper, we propose a deadlock-free routing algorithm, referred to as Balanced Dimension-Order Routing (BDOR), which provides the balanced minimal paths to each destination based on the simple routing regulations. Since the BDOR has the similar path regularity to that of the dimensionorder routing, its implementation can be lightweight, and most of its modules can be borrowed from the router for the dimension-order routing. Evaluation results show that the BDOR router increases by 3.4% hardware amount compared with the router for the dimension-order routing. Also show that the throughput of the BDOR outperforms on average up to 14% that of the dimension-order routing on two-dimensional mesh and torus.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing Workshops
Pages499-506
Number of pages8
DOIs
Publication statusPublished - 2009
Event38th International Conference Parallel Processing Workshops, ICPPW 2009 - Vienna, Austria
Duration: 2009 Sep 222009 Sep 25

Other

Other38th International Conference Parallel Processing Workshops, ICPPW 2009
CountryAustria
CityVienna
Period09/9/2209/9/25

Fingerprint

K-ary N-cubes
Order Dimension
Routers
Routing
Routing algorithms
Router
Throughput
Topology
Hardware
Torus
Mesh
Minimal Path
Deadlock
Routing Algorithm
Regularity

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Montañana, J. M., Koibuchi, M., Matsutani, H., & Amano, H. (2009). Balanced dimension-order routing for k-ary n-cubes. In Proceedings of the International Conference on Parallel Processing Workshops (pp. 499-506). [5365405] https://doi.org/10.1109/ICPPW.2009.64

Balanced dimension-order routing for k-ary n-cubes. / Montañana, Jose Miguel; Koibuchi, Michihiro; Matsutani, Hiroki; Amano, Hideharu.

Proceedings of the International Conference on Parallel Processing Workshops. 2009. p. 499-506 5365405.

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

Montañana, JM, Koibuchi, M, Matsutani, H & Amano, H 2009, Balanced dimension-order routing for k-ary n-cubes. in Proceedings of the International Conference on Parallel Processing Workshops., 5365405, pp. 499-506, 38th International Conference Parallel Processing Workshops, ICPPW 2009, Vienna, Austria, 09/9/22. https://doi.org/10.1109/ICPPW.2009.64
Montañana JM, Koibuchi M, Matsutani H, Amano H. Balanced dimension-order routing for k-ary n-cubes. In Proceedings of the International Conference on Parallel Processing Workshops. 2009. p. 499-506. 5365405 https://doi.org/10.1109/ICPPW.2009.64
Montañana, Jose Miguel ; Koibuchi, Michihiro ; Matsutani, Hiroki ; Amano, Hideharu. / Balanced dimension-order routing for k-ary n-cubes. Proceedings of the International Conference on Parallel Processing Workshops. 2009. pp. 499-506
@inproceedings{79d11cceda6d4cdf8c8058a65005d2e4,
title = "Balanced dimension-order routing for k-ary n-cubes",
abstract = "Current Network-on-Chip (NoC) architectures sometimes employ mesh or torus topology with the dimensionorder routing. In this paper, we propose a deadlock-free routing algorithm, referred to as Balanced Dimension-Order Routing (BDOR), which provides the balanced minimal paths to each destination based on the simple routing regulations. Since the BDOR has the similar path regularity to that of the dimensionorder routing, its implementation can be lightweight, and most of its modules can be borrowed from the router for the dimension-order routing. Evaluation results show that the BDOR router increases by 3.4{\%} hardware amount compared with the router for the dimension-order routing. Also show that the throughput of the BDOR outperforms on average up to 14{\%} that of the dimension-order routing on two-dimensional mesh and torus.",
author = "Monta{\~n}ana, {Jose Miguel} and Michihiro Koibuchi and Hiroki Matsutani and Hideharu Amano",
year = "2009",
doi = "10.1109/ICPPW.2009.64",
language = "English",
isbn = "9780769538037",
pages = "499--506",
booktitle = "Proceedings of the International Conference on Parallel Processing Workshops",

}

TY - GEN

T1 - Balanced dimension-order routing for k-ary n-cubes

AU - Montañana, Jose Miguel

AU - Koibuchi, Michihiro

AU - Matsutani, Hiroki

AU - Amano, Hideharu

PY - 2009

Y1 - 2009

N2 - Current Network-on-Chip (NoC) architectures sometimes employ mesh or torus topology with the dimensionorder routing. In this paper, we propose a deadlock-free routing algorithm, referred to as Balanced Dimension-Order Routing (BDOR), which provides the balanced minimal paths to each destination based on the simple routing regulations. Since the BDOR has the similar path regularity to that of the dimensionorder routing, its implementation can be lightweight, and most of its modules can be borrowed from the router for the dimension-order routing. Evaluation results show that the BDOR router increases by 3.4% hardware amount compared with the router for the dimension-order routing. Also show that the throughput of the BDOR outperforms on average up to 14% that of the dimension-order routing on two-dimensional mesh and torus.

AB - Current Network-on-Chip (NoC) architectures sometimes employ mesh or torus topology with the dimensionorder routing. In this paper, we propose a deadlock-free routing algorithm, referred to as Balanced Dimension-Order Routing (BDOR), which provides the balanced minimal paths to each destination based on the simple routing regulations. Since the BDOR has the similar path regularity to that of the dimensionorder routing, its implementation can be lightweight, and most of its modules can be borrowed from the router for the dimension-order routing. Evaluation results show that the BDOR router increases by 3.4% hardware amount compared with the router for the dimension-order routing. Also show that the throughput of the BDOR outperforms on average up to 14% that of the dimension-order routing on two-dimensional mesh and torus.

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

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

U2 - 10.1109/ICPPW.2009.64

DO - 10.1109/ICPPW.2009.64

M3 - Conference contribution

AN - SCOPUS:77949535659

SN - 9780769538037

SP - 499

EP - 506

BT - Proceedings of the International Conference on Parallel Processing Workshops

ER -