Application-Aware Deadlock-Free Oblivious Routing

Application-Aware Deadlock-Free Oblivious Routing

Show other versions (1)

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...

Full description

Bibliographic Details
Main Authors: Kinsy, Michel A., Cho, Myong Hyon, Wen, Tina, Suh, Edward, Van Dijk, Marten, Devadas, Srinivas
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Association for Computing Machinery 2010
Online Access:http://hdl.handle.net/1721.1/51809
https://orcid.org/0000-0001-8253-7714
https://orcid.org/0000-0003-4301-1159
https://orcid.org/0000-0002-1224-0314

Internet

http://hdl.handle.net/1721.1/51809
https://orcid.org/0000-0001-8253-7714
https://orcid.org/0000-0003-4301-1159
https://orcid.org/0000-0002-1224-0314

Similar Items