Jens Domke, Torsten Hoefler, Satoshi Matsuoka. Routing on the Dependency Graph: A New Approach to Deadlock-Free High-Performance Routing. In Hiroshi Nakashima, Kenjiro Taura, Jack Lange, editors, Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing, HPDC 2016, Kyoto, Japan, May 31 - June 04, 2016. pages 3-14, ACM, 2016. [doi]
@inproceedings{DomkeHM16,
title = {Routing on the Dependency Graph: A New Approach to Deadlock-Free High-Performance Routing},
author = {Jens Domke and Torsten Hoefler and Satoshi Matsuoka},
year = {2016},
doi = {10.1145/2907294.2907313},
url = {http://doi.acm.org/10.1145/2907294.2907313},
researchr = {https://researchr.org/publication/DomkeHM16},
cites = {0},
citedby = {0},
pages = {3-14},
booktitle = {Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing, HPDC 2016, Kyoto, Japan, May 31 - June 04, 2016},
editor = {Hiroshi Nakashima and Kenjiro Taura and Jack Lange},
publisher = {ACM},
isbn = {978-1-4503-4314-5},
}