@inproceedings {Simula.simula.1554,
	title = {Discovery and Routing of Degraded Fat-Trees},
	journal = {2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies},
	year = {2012},
	month = {December},
	pages = {689-694},
	publisher = {IEEE Computer Society},
	type = {Conference},
	address = {Los Alamitos},
	abstract = {The fat-tree topology has become a popular choice for InfiniBand enterprise systems due to its deadlock freedom, fault-tolerance and full bisection bandwidth. In the HPC domain, InfiniBand fabric is used in almost 42\% of the systems on the latest Top 500 list, and many of those systems are based on the fat-tree topology. Despite the popularity of the fat-tree topology, little research has been done to compare the behavior of InfiniBand routing algorithms on degraded fat-tree topologies. In this paper, we identify the weaknesses of the current fat-tree routing and propose enhancements that liberalize the restrictions imposed on the routed fabric. Furthermore, we present a thorough analysis of non-proprietary routing algorithms that are implemented in the InfiniBand Open Subnet Manager. Our results show that even though the performance of a fat-tree routed network deteriorates predictably with the number of failed links, fat-tree routing algorithm is still the best choice for severely degraded fat-tree fabrics.},
	keywords = {Conference},
	author = {Bogdanski, Bartosz and Bj{\o}rn Dag {Johnsen} and Reinemo, Sven-Arne and Frank Olaf {Sem-Jacobsen}},
	editor = {Shen, Hong and Sang, Yingpeng and Li, Yidong and Qian, Depai and Albert Y. {Zomaya}}
}
