Application-Aware Deadlock-Free Oblivious Routing
Name
24675326d01.pdf
Size
384.57 KB
Format
Adobe PDF
Checksum (MD5)
895e3a804ad0fda87bc057257a21e4f8
Author(s)
Kinsy, Michel A.
Cho, Myong Hyon
Wen, Tina
Suh, Edward
Van Dijk, Marten
Devadas, Srinivas
Date Issued
2009
Journal
Computer Architecture News
Publisher
Association for Computing Machinery
Citation
Kinsy, Michel A. et al. “Application-aware deadlock-free oblivious routing.” SIGARCH Comput. Archit. News 37.3 (2009): 208-219.
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
Persistent DSpace Link
DOI of Published Version
http://doi.acm.org/10.1145/1555815.1555782
