Balanced Dimension-Order Routing for k-ary n-cubes

Authors:
Jose Miguel Montanana;Michihiro Koibuchi;Hiroki Matsutani;Hideharu Amano
Affiliations:
-;-;-;-
Venue:
ICPPW '09 Proceedings of the 2009 International Conference on Parallel Processing Workshops
Year:
2009

Citing 0
Cited 3

A latency simulator for many-core systems

Proceedings of the 44th Annual Simulation Symposium
Refinement-Based modeling of 3d nocs

FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Optimal wavelength assignment in the implementation of parallel algorithms with ternary n-cube communication pattern on mesh optical network

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current Network-on-Chip (NoC) architectures sometimes employ mesh or torus topology with the dimension-order 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 dimension-order 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.