Programming Parallel Dense Matrix Factorizations and Inversion for New-Generation NUMA Architectures

We propose a methodology to address the programmability issues derived from the emergence of new-generation shared-memory NUMA architectures. For this purpose, we employ dense matrix factorizations and matrix inversion (DMFI) as a use case, and we target two modern architectures (AMD Rome and Huawei...

Descripción completa

Detalles Bibliográficos
Autores: Catalán Pallarés, Sandra, Igual Peña, Francisco D., Herrero, José R., Quintana Ortí, Enrique S., Rodríguez Sánchez, Rafael
Tipo de recurso: artículo
Fecha de publicación:2023
País:España
Institución:Universidad de Castilla-La Mancha
Repositorio:RUIdeRA. Repositorio Institucional de la UCLM
OAI Identifier:oai:ruidera.uclm.es:10578/44249
Acceso en línea:https://doi.org/10.1016/j.jpdc.2023.01.004
https://hdl.handle.net/10578/44249
Access Level:acceso abierto
Palabra clave:Chiplets
Dense linear algebra
NUMA architectures
Portability
Shared memory programming
Descripción
Sumario:We propose a methodology to address the programmability issues derived from the emergence of new-generation shared-memory NUMA architectures. For this purpose, we employ dense matrix factorizations and matrix inversion (DMFI) as a use case, and we target two modern architectures (AMD Rome and Huawei Kunpeng 920) that exhibit configurable NUMA topologies. Our methodology pursues performance portability across different NUMA configurations by proposing multi-domain implementations for DMFI plus a hybrid task- and loop-level parallelization that configures multi-threaded executions to fix core-to-data binding, exploiting locality at the expense of minor code modifications. In addition, we introduce a generalization of the multi-domain implementations for DMFI that offers support for virtually any NUMA topology in present and future architectures. Our experimentation on the two target architectures for three representative dense linear algebra operations validates the proposal, reveals insights on the necessity of adapting both the codes and their execution to improve data access locality, and reports performance across architectures and inter- and intra-socket NUMA configurations competitive with state-of-the-art message-passing implementations, maintaining the ease of development usually associated with shared-memory programming.