On the Overhead of Topology Discovery for Locality-aware Scheduling in HPC - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

On the Overhead of Topology Discovery for Locality-aware Scheduling in HPC

(1)
1

Abstract

The increasing complexity of parallel computing platforms requires a deep knowledge of the hardware and of the application needs. Locality a key criteria for performance optimization. It involves software tools to expose information about the hardware topology to high performance runtime libraries. We show that the overhead of gathering such information from the operating system is significant on large computing nodes that run Linux. This overhead also increases more than linearly with the number of processes that perform it simultaneously. We then study the actual needs of the HPC software ecosystem in terms of topology information. We propose some ways to avoid multiple expensive topology discovery and to share topology information between components such as the resource manager or the runtime libraries.
Fichier principal
Vignette du fichier
article.pdf (227.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01402755 , version 1 (25-11-2016)
hal-01402755 , version 2 (03-12-2016)
hal-01402755 , version 3 (13-07-2017)

Identifiers

Cite

Brice Goglin. On the Overhead of Topology Discovery for Locality-aware Scheduling in HPC. PDP2017 - 25th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, Mar 2017, St Petersburg, Russia. pp.9, ⟨10.1109/PDP.2017.35⟩. ⟨hal-01402755v3⟩
522 View
365 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More