Skip to main content

COMPUTACION Y COMUNICACIONES DE ALTAS PRESTACIONES CONSCIENTES DEL CONSUMO ENERGETICO. APLICACIONES AL APRENDIZAJE PROFUNDO COMPUTACIONAL - UPV

PID2020-113656RB-C22

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2020
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Anatomy of the BLIS family of algorithms for matrix multiplication

  • Castelló, Adrián|||0000-0002-8576-8451
  • Quintana-Ortí, Enrique S.|||0000-0002-5454-165X
  • Igual, Francisco D.
[EN] The efforts of the scientific community and hardware vendors to develop and optimize linear algebra codes have historically led to highly-tuned libraries, carefully adapted to the underlying processor architecture, with excellent (near-peak) performance. These optimization efforts, however, are commonly focused on obtaining the best performance possible when the involved operands are large and "squarish" matrices. New computationally-intensive applications (e.g., in deep learning) are increasingly demanding high-performance BLAS (Basic Linear Algebra Subprograms) also for small operands in any of their dimensions. In this paper, we tackle this problem by refactoring the general matrix-matrix multiplication (GEMM) algorithm within a specific high-performance implementation of BLAS, named BLIS, proposing a complete family of algorithmic variants to implement GEMM with different strategies to exploit the target cache hierarchy, together with the changes to be applied to architecture-specific codes to instantiate a complete GEMM implementation. Experimental results on an ARM processor (NVIDIA Carmel) reveal significant performance differences between the members of the GEMM family, depending on the shape and dimension of the matrix operands., This work was supported by the research project PID2020-113656RB-C22 of MCIN/AEI/10.13039/501100011033, EU (FEDER), the Spanish MINECO, under grants RTI2018-093684-B-I00, PID2021-126576NB-I00, and CM via Multiannual Agreement with Complutense University in the line Program to Stimulate Research for Young Doctors in the context of the V PRICIT under projects PR65/19-22445 and CM S2018/TCS-4423. A. Castello is a FJC2019-039222-I fellow supported by MCIN/AEI/10.13039/501100011033.
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

QR factorization on a long-vector processor

  • Tomás Domínguez, Andrés Enrique
  • Vizcaíno Serrano, Pablo
  • Quintana Ortí, Enrique Salvador
  • Mantovani, Filippo|||0000-0003-3559-4825
We build two high-performance implementations of the QR factorization optimized for the long vector units in the accelerator developed as part of the European Processor Initiative. Both realizations, based on the Householder and Gram-Schmidt (GS) methods respectively, are optimized via linear algebra kernels that can be reused for other applications. The experimental evaluation on an early test-chip of this accelerator shows significant gains over the LAPACK code running on a scalar RISCV core. It also shows the superiority of the Householder-based solution for square matrices and the advantages of GS for tall-and-skinny matrices when both the triangular and orthogonal factors are needed., This work was supported by projects PID2020-113656RB-C22 of MCIN/AEI/10.13039/501100011033 and PROMETEO 2023-CIPROM/2022/20 of the Generalitat Valenciana. Also supported by the EuroHPC Joint Undertaking (JU): FPA N. 800928 (EPI) and SGA N. 101036168 (EPI-SGA2). The JU receives support from the EU Horizon 2020 research and innovation programme and from Croatia, France, Germany, Greece, Italy, Netherlands, Portugal, Spain, Sweden, Denmark and Switzerland. The EPI-SGA2 project, PCI2022-132935 is also co-funded by MCIN/AEI /10.13039/501100011033 and by the UE NextGenerationEU/PRTR., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

QR factorization on a long-vector processor

  • Tomás Domínguez, Andrés Enrique
  • Vizcaíno Serrano, Pablo
  • Quintana Ortí, Enrique Salvador
  • Mantovani, Filippo
We build two high-performance implementations of the QR factorization optimized for the long vector units in the accelerator developed as part of the European Processor Initiative. Both realizations, based on the Householder and Gram-Schmidt (GS) methods respectively, are optimized via linear algebra kernels that can be reused for other applications. The experimental evaluation on an early test-chip of this accelerator shows significant gains over the LAPACK code running on a scalar RISCV core. It also shows the superiority of the Householder-based solution for square matrices and the advantages of GS for tall-and-skinny matrices when both the triangular and orthogonal factors are needed., This work was supported by projects PID2020-113656RB-C22 of MCIN/AEI/10.13039/501100011033 and PROMETEO 2023-CIPROM/2022/20 of the Generalitat Valenciana. Also supported by the EuroHPC Joint Undertaking (JU): FPA N. 800928 (EPI) and SGA N. 101036168 (EPI-SGA2). The JU receives support from the EU Horizon 2020 research and innovation programme and from Croatia, France, Germany, Greece, Italy, Netherlands, Portugal, Spain, Sweden, Denmark and Switzerland. The EPI-SGA2 project, PCI2022-132935 is also co-funded by MCIN/AEI /10.13039/501100011033 and by the UE NextGenerationEU/PRTR., Peer Reviewed, Postprint (author's final draft)