@inproceedings{domke-deadlock-2011,
	author = {Jens Domke and Torsten Hoefler and Wolfgang E. Nagel},
	title = {{Deadlock-Free Oblivious Routing for Arbitrary Topologies}},
	booktitle = {Proceedings of the 25th IEEE International Parallel \& Distributed Processing Symposium (IPDPS)},
	year = 2011,
	month = may,
	pages = {613--624},
	publisher = {IEEE Computer Society},
	address = {Washington, DC, USA},
	location = {Anchorage, Alaska, USA},
	isbn = {0-7695-4385-7},
	abstract = {Efficient deadlock-free routing strategies are crucial to the performance of large-scale computing systems. There are many methods but it remains a challenge to achieve lowest latency and highest bandwidth for irregular or unstructured high-performance networks. We investigate a novel routing strategy based on the single-source-shortest-path routing algorithm and extend it to use virtual channels to guarantee deadlock-freedom. We show that this algorithm achieves minimal latency and high bandwidth with only a low number of virtual channels and can be implemented in practice. We demonstrate that the problem of finding the minimal number of virtual channels needed to route a general network deadlock-free is NP-complete and we propose different heuristics to solve the problem. We implement all proposed algorithms in the Open Subnet Manager of InfiniBand and compare the number of needed virtual channels and the bandwidths of multiple real and artificial network topologies which are established in practice. Our approach allows to use the existing virtual channels more effectively to guarantee deadlock-freedom and increase the effective bandwidth of up to a factor of two. Application benchmarks show an improvement of up to 95%. Our routing scheme is not limited to InfiniBand but can be deployed on existing InfiniBand installations to increase network performance transparently without modifications to the user applications.},
}