@inproceedings{d83e316284e64aee9d53585e725c1e09,
title = "Application-aware deadlock-free oblivious routing",
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.",
keywords = "Oblivious routing, On-chip interconnection networks, Systems-on-chip",
author = "Michel Kinsy and Cho, {Myong Hyon} and Tina Wen and Edward Suh and {Van Dijk}, Marten and Srinivas Devadas",
year = "2009",
doi = "10.1145/1555754.1555782",
language = "English (US)",
isbn = "9781605585260",
series = "Proceedings - International Symposium on Computer Architecture",
pages = "208--219",
booktitle = "ISCA 2009 - 36th Annual International Symposium on Computer Architecture, Conference Proceedings",
note = "ISCA 2009 - 36th Annual International Symposium on Computer Architecture ; Conference date: 20-06-2009 Through 24-06-2009",
}