LEF: long edge first routing for two-dimensional mesh network on chip

Authors:
Ryosuke Sasakawa;Kenji Kise
Affiliations:
Tokyo Institute of Technology;Tokyo Institute of Technology
Venue:
Proceedings of the Sixth International Workshop on Network on Chip Architectures
Year:
2013

Citing 12
Cited 0

A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
The Odd-Even Turn Model for Adaptive Routing

IEEE Transactions on Parallel and Distributed Systems
Virtual-Channel Flow Control

IEEE Transactions on Parallel and Distributed Systems
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
Principles and Practices of Interconnection Networks

Principles and Practices of Interconnection Networks
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks

Proceedings of the 32nd annual international symposium on Computer Architecture
DyXY: a proximity congestion-aware deadlock-free dynamic routing method for network on chip

Proceedings of the 43rd annual Design Automation Conference
Optimization of All-to-All Communication on the Blue Gene/L Supercomputer

ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing
An abacus turn model for time/space-efficient reconfigurable routing

Proceedings of the 38th annual international symposium on Computer architecture
The IBM Blue Gene/Q interconnection network and message unit

Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
LEAR -- A Low-Weight and Highly Adaptive Routing Method for Distributing Congestions in On-chip Networks

PDP '12 Proceedings of the 2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing
Looking under the hood of the IBM blue gene/Q network

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 2D mesh Network-on-Chip, if dimensions have distinct lengths, there is the difference between the performance of DORs (XY-routing and YX-routing). Furthermore, when multiple parallel applications are mapped in a 2D mesh manycore processor at a time, each parallel application are not necessarily mapped as a square mesh (like n X n mesh). In this paper, we present the routing algorithm which selects a routing algorithm performing well from both of DORs even if applications were not mapped as a square mesh.