On the influence of selection function on the performance of fat-trees under hot-spot traffic

Fat-tree topology has drawn a considerable interest because it offers a rich connectivity among source and destination nodes. Routing in fat-trees is composed of a routing function and a selection function. The selection function was shown to have a great impact on the performance [2]. In this paper, we study the performance of fat-trees in case of hot-spot traffic. First, we propose a new selection function SAOP, which is based on the stage and the source node address. We argue that the SAOP is more suitable for hot-spot traffic than other selection functions. We show that the new selection function outperforms other well known selections functions under hot-spot traffic. Then, we compare a deterministic version of the SAOP to that of the adaptive one. We show that their performances are comparable. This guarantees an in-order packet delivery. Finally, we analyze the SAOP algorithm and show that the congestion occurs only within the parent switches of the destination which explain the outperforming results of the SAOP.

[1]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[2]  Charles E. Leiserson,et al.  Randomized Routing on Fat-Trees , 1989, Adv. Comput. Res..

[3]  Antonio Robles,et al.  Enforcing In-Order Packet Delivery in PC Clusters using Adaptive Routing , 2004 .

[4]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[5]  Pedro López,et al.  On the Influence of the Selection Function on the Performance of Fat-Trees , 2006, Euro-Par.

[6]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[7]  Youngsong Mun,et al.  Design and performance analysis of the Practical Fat Tree Network using a butterfly network , 1997, J. Syst. Archit..

[8]  Laurence T. Yang,et al.  High Performance Computational Science and Engineering , 2005 .

[9]  Pedro López,et al.  Deterministic versus Adaptive Routing in Fat-Trees , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[10]  Fabrizio Petrini,et al.  k-ary n-trees: high performance networks for massively parallel architectures , 1997, Proceedings 11th International Parallel Processing Symposium.

[11]  Vu-Duc Ngo,et al.  Analyzing the Performance of Mesh and Fat-Tree Topologies for Network on Chip Design , 2005, EUC.

[12]  José Duato,et al.  Dynamic Fault Tolerance in Fat Trees , 2011, IEEE Transactions on Computers.

[13]  Zhen Yang,et al.  Hotspot Avoidance for P2P Streaming Distribution Application: A Game Theoretic Approach , 2009, IEEE Transactions on Parallel and Distributed Systems.

[14]  André DeHon.  Fat-Tree Routing for Transit , 1990 .