@inproceedings {Simula.netsys.16,
	title = {Achieving Predictable High Performance in Imbalanced Fat Trees},
	journal = {Proceedings of the 16th IEEE International Conference on Parallel and Distributed Systems},
	year = {2010},
	month = {December},
	pages = {381-388},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {Abstract-The fat-tree topology has become a popular choice for InfiniBand fabrics due to its inherent deadlock freedom, fault-tolerance and full bisection bandwidth. InfiniBand is used by more than 40\% of the systems on the latest Top 500 list, and many of these systems are based on a fat-tree topology. However, the current InfiniBand fat-tree routing algorithm suffers from flaws that reduce its scalability and flexibility. Counter-intuitively, the achievable throughput per node deteriorates both when the number of nodes in a tree decreases or when the node distribution among leaves is nonuniform. In this paper, we identify the weaknesses of the current enhanced fat-tree routing algorithm in OpenFabrics Enterprise Distribution and we propose extensions to it that alleviate all performance problems related to node distribution. The new algorithm is implemented in OpenSM for real world evaluation and for future contribution to the OpenFabrics community. We demonstrate that our solution allows to achieve a predictable high throughput regardless of the number of nodes and their distribution. Furthermore, the simulations show that our extensions improve throughput up to 30\% depending on topology size and node distribution.},
	isbn = {978-0-7695-4307-9},
	author = {Bogdanski, Bartosz and Frank Olaf {Sem-Jacobsen} and Reinemo, Sven-Arne and Skeie, Tor and Holen, Line and Lars Paul {Huse}},
	editor = {Huang, Xiaoxia}
}
@inproceedings {Simula.netsys.12,
	title = {Host Side Dynamic Reconfiguration With InfiniBand},
	journal = {2010 IEEE International Conference on Cluster Computing},
	year = {2010},
	pages = {126-135},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {Rerouting around faulty components and migration of jobs both require reconfiguration of data structures in the Queue Pairs residing in the hosts on an InfiniBand cluster. In this paper we report an implementation of dynamic reconfiguration of such host side data-structures. Our implementation preserves the Queue Pairs, and lets the application run without being interrupted. With this implementation, we demonstrate a complete solution to fault tolerance in an InfiniBand network, where dynamic network reconfiguration to a topology-agnostic routing function is used to avoid malfunctioning components. This solution is in principle able to let applications run uninterruptedly on the cluster, as long as the topology is physically connected. Through measurements on our test-cluster we show that the increased cost of our method in setup latency is negligible, and that there is only a minor reduction in throughput during reconfiguration.},
	isbn = {978-0-7695-4220-1},
	author = {Wei Lin {Guay} and Reinemo, Sven-Arne and Lysne, Olav and Skeie, Tor and Bj{\o}rn Dag {Johnsen} and Holen, Line},
	editor = {Gu, Xiaohui and Ma, Xiaosong}
}
