Abstract
Fat-tree topology has become very popular among switch manufacturers. Routing in fat-trees is composed of two phases, an adaptive upwards phase, and a deterministic downwards phase. The unique downwards path to the destination depends on the switch that has been reached in the upwards phase. As adaptive routing is used in the ascending phase, several output ports are possible at each switch and the final choice depends on the selection function. The impact of the selection function on performance has been previously studied for direct networks and has not resulted to be very important. In fat-trees, the decisions made in the upwards phase by the selection function can be critical, since it determines the switch reached in the upwards phase, and therefore the unique downwards path to the destination. In this paper, we analyze the effect of the selection function on fat-trees. Several selection functions are defined, compared and evaluated. The evaluation shows that selection function has a great impact on fat-trees.
This work was supported by the Spanish MCYT under Grant TIC2003-08154-C06-01.
Chapter PDF
Similar content being viewed by others
References
Badr, S., Podar, P.: An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies. IEEE Transactions on Computers (October 1989)
Dally, W.J., Aoki, H.: Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels. IEEE Transactions on Parallel and Distributed Systems (April 1993)
Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks. Morgan Kaufmann, San Francisco (2004)
Duato, J.: Improving the Efficiency of Virtual Channels with Time-Dependent Selection Functions. In: Proc. Parallel Architectures and Languages Europe (1992)
Glass, C., Ni, L.M.: The Turn Model for Adaptive Routing. Journal of the Association for Computing Machinery (September 1994)
Feng, W., Shin, K.: Impact of Selection Functions on Routing Algorithm Performance in Multicomputer Networks. In: Proc. ACM International Conference on Supercomputing (1997)
FLich, J., Malumbres, M.P., Lopez, P., Duato, J.: Improving Routing Performance in Myrinet Networks. In: Proc. 14th International Parallel and Distributed Processing Symp. (2000)
Funahashi, A., Koibuchi, M., Jouraku, A., Amano, H.: The Impact of Output Selection Function on Adaptive Routing. In: Proc. International Conference on Computers And Their Applications (March 2001)
Koibuchi, M., Jouraku, A., Amano, H.: MMLRU Selection Function: A Simple and Efficient Output Selection Function in Adaptive Routing. IEICE Transactions (2005)
Martínez, J.C., Silla, F., López, P., Duato, J.: On the Influence of the Selection Function on the Performance of Networks of Workstation. In: Proc. High Performance Computing (2000)
Petrini, F., Vanneshi, M.: k-ary n-trees: High Performance Networks for Massively Parallel Architectures. In: Proc. International Parallel Processing Symp. (1997)
Petrini, F., Vanneschi, M.: Performance analysis of wormhole routed K-ary N-trees. International Journal of Foundations of Computer Science (1997)
Mellanox homepage, http://www.mellanox.com/
Quadrics homepage, http://www.quadrics.com/
Myricom homepage, http://www.myri.com/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gilabert, F., Gómez, M.E., López, P., Duato, J. (2006). On the Influence of the Selection Function on the Performance of Fat-Trees. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds) Euro-Par 2006 Parallel Processing. Euro-Par 2006. Lecture Notes in Computer Science, vol 4128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11823285_91
Download citation
DOI: https://doi.org/10.1007/11823285_91
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37783-2
Online ISBN: 978-3-540-37784-9
eBook Packages: Computer ScienceComputer Science (R0)