dc.contributor.author | Kinsy, Michel A. | |
dc.contributor.author | Cho, Myong Hyon | |
dc.contributor.author | Wen, Tina | |
dc.contributor.author | Suh, Edward | |
dc.contributor.author | Van Dijk, Marten | |
dc.contributor.author | Devadas, Srinivas | |
dc.date.accessioned | 2010-02-24T16:28:07Z | |
dc.date.available | 2010-02-24T16:28:07Z | |
dc.date.issued | 2009 | |
dc.date.submitted | 2009-06 | |
dc.identifier.issn | 0163-5964 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/51809 | |
dc.description.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. | en |
dc.language.iso | en_US | |
dc.publisher | Association for Computing Machinery | en |
dc.relation.isversionof | http://doi.acm.org/10.1145/1555815.1555782 | en |
dc.rights | Attribution-Noncommercial-Share Alike 3.0 Unported | en |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en |
dc.source | author/dept web page | en |
dc.title | Application-Aware Deadlock-Free Oblivious Routing | en |
dc.type | Article | en |
dc.identifier.citation | Kinsy, Michel A. et al. “Application-aware deadlock-free oblivious routing.” SIGARCH Comput. Archit. News 37.3 (2009): 208-219. | en |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.approver | Devadas, Srinivas | |
dc.contributor.mitauthor | Kinsy, Michel A. | |
dc.contributor.mitauthor | Cho, Myong Hyon | |
dc.contributor.mitauthor | Wen, Tina | |
dc.contributor.mitauthor | Van Dijk, Marten | |
dc.contributor.mitauthor | Devadas, Srinivas | |
dc.relation.journal | Computer Architecture News | en |
dc.eprint.version | Author's final manuscript | |
dc.type.uri | http://purl.org/eprint/type/SubmittedJournalArticle | en |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en |
dspace.orderedauthors | Kinsy, Michel A.; Cho, Myong Hyon; Wen, Tina; Suh, Edward; van Dijk, Marten; Devadas, Srinivas | en |
dc.identifier.orcid | https://orcid.org/0000-0001-8253-7714 | |
dc.identifier.orcid | https://orcid.org/0000-0003-4301-1159 | |
dc.identifier.orcid | https://orcid.org/0000-0002-1224-0314 | |
dspace.mitauthor.error | true | |
mit.license | OPEN_ACCESS_POLICY | en |
mit.metadata.status | Complete | |