%0 Conference Paper %F Oral %T Node-Type-Based Load-Balancing Routing for Parallel Generalized Fat-Trees %+ Universidad de Castilla-La Mancha = University of Castilla-La Mancha (UCLM) %+ Laboratoire d'Informatique Parallélisme Réseaux Algorithmes Distribués (LI-PaRAD) %+ Atos Bull %A Gliksberg, John %A Quintin, Jean-Noel %A Garcia, Pedro Javier %< avec comité de lecture %B 2018 IEEE 4th International Workshop on High-Performance Interconnection Networks in the Exascale and Big-Data Era (HiPINEB) %C Vienna, France %I IEEE %P 9-15 %8 2018-02-24 %D 2018 %Z 2211.11818 %R 10.1109/HiPINEB.2018.00010 %K HPC %K routing %K fat-tree %K PGFT %K Dmodk %K Smodk %K heterogeneity %Z Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC] %Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers %X High-Performance Computing (HPC) clusters are made up of a variety of node types (usually compute, I/O, service, and GPGPU nodes) and applications don't use nodes of a different type the same way. Resulting communication patterns reflect organization of groups of nodes, and current optimal routing algorithms for all-to-all patterns will not always maximize performance for group-specific communications. Since application communication patterns are rarely available beforehand, we choose to rely on node types as a good guess for node usage. We provide a description of node type heterogeneity and analyse performance degradation caused by unlucky repartition of nodes of the same type. We provide an extension to routing algorithms for Parallel Generalized Fat-Tree topologies (PGFTs) which balances load amongst groups of nodes of the same type. We show how it removes these performance issues by comparing results in a variety of situations against corresponding classical algorithms. %G English %2 https://universite-paris-saclay.hal.science/hal-03861727/document %2 https://universite-paris-saclay.hal.science/hal-03861727/file/article.pdf %L hal-03861727 %U https://universite-paris-saclay.hal.science/hal-03861727 %~ UVSQ %~ UNIV-PARIS-SACLAY %~ LI-PARAD %~ UVSQ-SACLAY %~ UVSQ-UPSACLAY %~ GS-COMPUTER-SCIENCE