@inproceedings{domke-routing-2016,
	author = {Domke, Jens and Hoefler, Torsten and Matsuoka, Satoshi},
	title = {{Routing on the Dependency Graph: A New Approach to Deadlock-Free High-Performance Routing}},
	booktitle = {Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing},
	series = {HPDC '16},
	year = {2016},
	isbn = {978-1-4503-4314-5},
	location = {Kyoto, Japan},
	pages = {3--14},
	numpages = {12},
	url = {http://doi.acm.org/10.1145/2907294.2907313},
	doi = {10.1145/2907294.2907313},
	acmid = {2907313},
	publisher = {ACM},
	address = {New York, NY, USA},
	abstract = {Lossless interconnection networks are omnipresent in high performance computing systems, data centers and network-on-chip architectures. Such networks require efficient and deadlock-free routing functions to utilize the available hardware. Topology-aware routing functions become increasingly inapplicable, due to irregular topologies, which either are irregular by design or as a result of hardware failures. Existing topology-agnostic routing methods either suffer from poor load balancing or are not bounded in the number of virtual channels needed to resolve deadlocks in the routing tables. We propose a novel topology-agnostic routing approach which implicitly avoids deadlocks during the path calculation instead of solving both problems separately. We present a model implementation, called Nue, of a destination-based and oblivious routing function. Nue routing heuristically optimizes the load balancing while enforcing deadlock-freedom without exceeding a given number of virtual channels, which we demonstrate based on the InfiniBand architecture.},
}