Abstract
Topology and routing algorithm are two key design parameters for interconnection networks. They highly define the performance achieved by the network, but also its complexity and cost. Many of the commodity interconnects for clusters are based on the fat–tree topology, which allows both a rich interconnection among the nodes of the network and the use of adaptive routing. In this paper, we analyze how the routing algorithm affects the complexity of the switch, and considering this, we also propose and analyze some extensions of the fat–tree topology to take advantage of the available hardware resources. We analyze not only the impact on performance of these extensions but also their influence over switch complexity, analyzing its cost.
Chapter PDF
Similar content being viewed by others
References
Dally, W., Towles, B.: Principles and Practices of Interconnection Networks. Morgan Kaufmann (2003)
Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks. An Engineering Aproach. Morgan Kaufmann (2004)
Gilabert, F., Gómez, M.E., López, P., Duato, J.: On the influence of the selection function on the performance of fat-trees, pp. 864–873 (2006)
Leiserson, C.E.: Fat-trees: Universal networks for hardware-efficient supercomputing. In: ICPP, pp. 393–402 (1985)
Petrini, F., Vanneschi, M.: k–ary n–trees: High performance networks for massively parallel architecture. IEEE Micro 15 (1995)
Tianhe-1a, http://www.nscc-tj.gov.cn/en/
Gómez, C., Gilabert, F., Gómez, M.E., López, P., Duato, J.: Deterministic versus adaptive routing in fat-trees. In: 21th Int. Parallel and Distributed Processing Symposium (April 2007)
Nachiondo, T., Flich, J., Duato, J.: Buffer management strategies to reduce hol blocking. IEEE Trans. Parallel Distrib. Syst. 21(6), 739–753 (2010)
Gómez, C., Gilabert, F., Gómez, M.E., López, P., Duato, J.: Ruft: Simplifying the fat-tree topology (December 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bermúdez Garzón, D., Gómez, C., Gómez, M.E., López, P., Duato, J. (2012). Towards an Efficient Fat–Tree like Topology. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds) Euro-Par 2012 Parallel Processing. Euro-Par 2012. Lecture Notes in Computer Science, vol 7484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32820-6_71
Download citation
DOI: https://doi.org/10.1007/978-3-642-32820-6_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32819-0
Online ISBN: 978-3-642-32820-6
eBook Packages: Computer ScienceComputer Science (R0)