Application-aware deadlock-free oblivious routing

Authors:
Michel A. Kinsy;Myong Hyon Cho;Tina Wen;Edward Suh;Marten van Dijk;Srinivas Devadas
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA, USA;Massachusetts Institute of Technology, Cambridge, MA, USA;Massachusetts Institute of Technology, Cambridge, MA, USA;Cornell University, Ithaca, NY, USA;Massachusetts Institute of Technology, Cambridge, MA, USA;Massachusetts Institute of Technology, Cambridge, MA, USA
Venue:
Proceedings of the 36th annual international symposium on Computer architecture
Year:
2009

Citing 33
Cited 14

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
The turn model for adaptive routing

Journal of the ACM (JACM)
ROMM routing on mesh and torus networks

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Deadlock-free oblivious wormhole routing with cyclic dependencies

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
iWarp: anatomy of a parallel computing system

iWarp: anatomy of a parallel computing system
The Odd-Even Turn Model for Adaptive Routing

IEEE Transactions on Parallel and Distributed Systems
Introduction to Algorithms

Introduction to Algorithms
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
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
Application-Specific Deadlock Free Wormhole Routing on Multicomputers

PARLE '92 Proceedings of the 4th International PARLE Conference on Parallel Architectures and Languages Europe
Throughput-centric routing algorithm design

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Fast Dynamic Reconfiguration in Irregular Networks

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
A Delay Model and Speculative Architecture for Pipelined Routers

HPCA '01 Proceedings of the 7th International Symposium on High-Performance Computer Architecture
Principles and Practices of Interconnection Networks

Principles and Practices of Interconnection Networks
DyAD: smart routing for networks-on-chip

Proceedings of the 41st annual Design Automation Conference
SUNMAP: a tool for automatic topology selection and generation for NoCs

Proceedings of the 41st annual Design Automation Conference
Low-Latency Virtual-Channel Routers for On-Chip Networks

Proceedings of the 31st annual international symposium on Computer architecture
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks

Proceedings of the 32nd annual international symposium on Computer Architecture
Efficient link capacity and QoS design for network-on-chip

Proceedings of the conference on Design, automation and test in Europe: Proceedings
A survey of research and practices of Network-on-chip

ACM Computing Surveys (CSUR)
A methodology for design of application specific deadlock-free routing algorithms for NoC systems

CODES+ISSS '06 Proceedings of the 4th international conference on Hardware/software codesign and system synthesis
ViChaR: A Dynamic Virtual Channel Regulator for Network-on-Chip Routers

Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture
NoC-Based FPGA: Architecture and Routing

NOCS '07 Proceedings of the First International Symposium on Networks-on-Chip
Toward Ideal On-Chip Communication Using Express Virtual Channels

IEEE Micro
Virtual Circuit Tree Multicasting: A Case for On-Chip Hardware Multicast Support

ISCA '08 Proceedings of the 35th Annual International Symposium on Computer Architecture
Design of Bandwidth Aware and Congestion Avoiding Efficient Routing Algorithms for Networks-on-Chip Platforms

NOCS '08 Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip
Diastolic arrays: throughput-driven reconfigurable computing

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Static virtual channel allocation in oblivious routing

NOCS '09 Proceedings of the 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip
New algorithms for the unsplittable flow problem

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II

Static virtual channel allocation in oblivious routing

NOCS '09 Proceedings of the 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip
ACES: application-specific cycle elimination and splitting for deadlock-free routing on irregular network-on-chip

Proceedings of the 47th Design Automation Conference
Moths: mobile threads for on-chip networks

Proceedings of the 19th international conference on Parallel architectures and compilation techniques
A framework for designing congestion-aware deterministic routing

Proceedings of the Third International Workshop on Network on Chip Architectures
Analysis of application-aware on-chip routing under traffic uncertainty

NOCS '11 Proceedings of the Fifth ACM/IEEE International Symposium on Networks-on-Chip
An abacus turn model for time/space-efficient reconfigurable routing

Proceedings of the 38th annual international symposium on Computer architecture
Application-aware deadlock-free oblivious routing based on extended turn-model

Proceedings of the International Conference on Computer-Aided Design
Leveraging latency-insensitivity to ease multiple FPGA design

Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays
TransCom: transforming stream communication for load balance and efficiency in networks-on-chip

Proceedings of the 44th Annual IEEE/ACM International Symposium on Microarchitecture
Self-aware computing in the Angstrom processor

Proceedings of the 49th Annual Design Automation Conference
Moths: Mobile threads for on-chip networks

ACM Transactions on Embedded Computing Systems (TECS) - Special section on ESTIMedia'12, LCTES'11, rigorous embedded systems design, and multiprocessor system-on-chip for cyber-physical systems
Heracles: a tool for fast RTL-based design space exploration of multicore processors

Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Bandwidth-optimal all-to-all exchanges in fat tree networks

Proceedings of the 27th international ACM conference on International conference on supercomputing
Fast pattern-specific routing for fat tree networks

ACM Transactions on Architecture and Code Optimization (TACO)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framework for application-aware routing that assures deadlock-freedom under one or more channels by forcing routes to conform to an acyclic channel dependence graph. Arbitrary minimal routes can be made deadlock-free through appropriate static channel allocation when two or more channels are available. Given bandwidth estimates for flows, we present a mixed integer-linear programming (MILP) approach and a heuristic approach for producing deadlock-free routes that minimize maximum channel load. The heuristic algorithm is calibrated using the MILP algorithm and evaluated on a number of benchmarks through detailed network simulation. Our framework can be used to produce application-aware routes that target the minimization of latency, number of flows through a link, bandwidth, or any combination thereof.