Joint Effects of Application Communication Pattern, Job Placement and Network Routing on Fat-Tree Systems

Among the high-radix and low-diameter networks, fat-tree topology is commonly used in high-performance computing (HPC) and datacenter systems. Resource and job management on HPC systems is critically important to mitigate application interference in order to achieve high system performance and utilization. Preliminary studies have shown the effect of job placement on parallel scientific applications performance in fat-tree network. In this work we explore the joint effects of job placement and network routing aware of applications communication pattern on fat-tree system. Applications can be classified into various groups according to the communication patterns. We further combine various job placement policies and routing algorithms and create six different configurations. The system performance is analyzed using communication, hops, traffic, and saturation data by performing fine-grained high-fidelity discrete event-driven simulation. Initial experimentation shows that the performance of HPC applications not only is related with the communication pattern, but also relies on the job placement and network routing on fat-tree systems.

[1]  V. E. Henson,et al.  BoomerAMG: a parallel algebraic multigrid solver and preconditioner , 2002 .

[2]  Zhiling Lan,et al.  Bandwidth-Aware Resource Management for Extreme Scale Systems , 2014 .

[3]  Jeffrey S. Vetter,et al.  Automated Characterization of Parallel Application Communication Patterns , 2015, HPDC.

[4]  Robert B. Ross,et al.  Modeling a Leadership-Scale Storage System , 2011, PPAM.

[5]  Cyriel Minkenberg,et al.  Quiet Neighborhoods: Key to Protect Job Performance Predictability , 2015, 2015 IEEE International Parallel and Distributed Processing Symposium.

[6]  Michael Lang,et al.  Optimized InfiniBandTM fat‐tree routing for shift all‐to‐all communication patterns , 2010, Concurr. Comput. Pract. Exp..

[7]  Jia Wang,et al.  Balancing job performance with system performance via locality-aware scheduling on torus-connected systems , 2014, 2014 IEEE International Conference on Cluster Computing (CLUSTER).

[8]  Xu Yang,et al.  Improving Batch Scheduling on Blue Gene/Q by Relaxing 5D Torus Network Allocation Constraints , 2015, 2015 IEEE International Parallel and Distributed Processing Symposium.

[9]  Javier Navaridas,et al.  Effects of Job and Task Placement on Parallel Scientific Applications Performance , 2009, 2009 17th Euromicro International Conference on Parallel, Distributed and Network-based Processing.

[10]  Jesús Labarta,et al.  Impact of Inter-application Contention in Current and Future HPC Systems , 2010, 2010 18th IEEE Symposium on High Performance Interconnects.

[11]  Robert B. Ross,et al.  Modeling a Million-Node Slim Fly Network Using Parallel Discrete-Event Simulation , 2016, SIGSIM-PADS.

[12]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[13]  Xu Yang,et al.  Improving Batch Scheduling on Blue Gene/Q by Relaxing Network Allocation Constraints , 2016, IEEE Transactions on Parallel and Distributed Systems.

[14]  Robert B. Ross,et al.  Watch Out for the Bully! Job Interference Study on Dragonfly Network , 2016, SC16: International Conference for High Performance Computing, Networking, Storage and Analysis.

[15]  Pramodita Sharma 2012 , 2013, Les 25 ans de l’OMC: Une rétrospective en photos.

[16]  Jesús Labarta,et al.  On the trade-off of mixing scientific applications on capacity high-performance computing systems , 2013, IET Comput. Digit. Tech..

[17]  Robert B. Ross,et al.  Preliminary Performance Analysis of Multi-rail Fat-Tree Networks , 2017, 2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID).

[18]  Jeffrey S. Vetter,et al.  Communication characteristics of large-scale scientific applications for contemporary cluster architectures , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[19]  Eitan Zahavi Fat-tree routing and node ordering providing contention free traffic for MPI global collectives , 2012, J. Parallel Distributed Comput..

[20]  Darren J. Kerbyson,et al.  Optimized InfiniBand TM fat-tree routing for shift all-to-all communication patterns , 2010, ISC 2010.

[21]  Christina Delimitrou,et al.  iBench: Quantifying interference for datacenter applications , 2013, 2013 IEEE International Symposium on Workload Characterization (IISWC).

[22]  Robert B. Ross,et al.  Study of Intra- and Interjob Interference on Torus Networks , 2016, 2016 IEEE 22nd International Conference on Parallel and Distributed Systems (ICPADS).

[23]  Robert B. Ross,et al.  CODES: Enabling Co-Design of Multi-Layer Exascale Storage Architectures , 2011 .

[24]  Tipp Moseley,et al.  Measuring interference between live datacenter applications , 2012, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis.

[25]  Mohan Kumar,et al.  On generalized fat trees , 1995, Proceedings of 9th International Parallel Processing Symposium.