Preliminary Interference Study About Job Placement and Routing Algorithms in the Fat-Tree Topology for HPC Applications

Among the high-radix and low-diameter networks, fat-tree topology is commonly used in HPC and datacenter systems. Resource and job management is critically important to mitigate application interference in order to achieve high system performance and utilization. Preliminary studies have shown the e...

Full description

Saved in:
Bibliographic Details
Main Authors: Peixin Qiao, Xin Wang, Xu Yang, Yuping Fan, Zhiling Lan
Format: Conference Proceeding
Language:English
Subjects:
Adaptive systems
Bandwidth
discrete event-driven simulation
fat-tree topology
HPC parallel application
Interference
Network topology
resource and job management
Routing
Switches
Topology
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Among the high-radix and low-diameter networks, fat-tree topology is commonly used in HPC and datacenter systems. Resource and job management 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 this work we study interference about job placement and routing algorithms 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 by performing fine-grained high-fidelity discrete event-driven simulation. Initial experimentation shows that the performance of HPC applications not only is related with its communication pattern, but also relies on the job placement and network routing on fat-tree systems.
ISSN:2168-9253
DOI:10.1109/CLUSTER.2017.90