A Source-to-Source NUMA Profiling Approach - Mines Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

A Source-to-Source NUMA Profiling Approach

Résumé

The design of HPC processors is driven by the purpose of packaging an increasing number of CPU cores. This trend in the multicore design faces the physical reality of integrating circuits into a single die in addition to the bottleneck of components sharing, thus the advent of Non-Uniform Memory Access (NUMA) with its typical packaging. Cutting-edge supercomputers are made up of such (manycore) compute nodes. In any case, the main issue is scalability. With a NUMA configuration, a memory access can be local (within the same NUMA node) or remote (from a NUMA node to another). The latter is the main concern w.r.t to efficiency because of the associated overhead is much more important. Dealing with this concern explicitly when designing a program is called NUMAaware implementation. With an existing code, the problem can be addressed by starting with an appropriate profiling. This is the focus of the present work, where we suggest a way to instrument the native code in order to get the type (i.e. local or remote) of each memory access and we provide a tool that supports the profiling process. We then propose a metric that takes these statistics about memory accesses and provides a value indicating the potential associated overhead.
Fichier principal
Vignette du fichier
A-807.pdf (558.91 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04292582 , version 1 (17-11-2023)

Identifiants

Citer

Leticia Suellen Farias Machado, Claude Tadonki, Hermes Senger. A Source-to-Source NUMA Profiling Approach. 2023 International Symposium on Computer Architecture and High Performance Computing Workshops (SBAC-PADW), Oct 2023, Porto Alegre, Brazil. pp.54-59, ⟨10.1109/SBAC-PADW60351.2023.00018⟩. ⟨hal-04292582⟩
14 Consultations
26 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More