Application-Aware Deadlock-Free Oblivious Routing
Author(s)
Kinsy, Michel A.; Cho, Myong Hyon; Wen, Tina; Suh, Edward; Van Dijk, Marten; Devadas, Srinivas; ... Show more Show less
Download24675326d01.pdf (384.5Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2009Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
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
ISSN
0163-5964