Héctor Martínez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Héctor Martínez has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Adrián Castelló
Universitat Politécnica de Valencia, Valencia, Spain
22 shared publications - Enrique S. Quintana Orti
Universitat Politécnica de Valencia, Valencia, Spain
22 shared publications - Francisco D. Igual
Universidad Complutense de Madrid
12 shared publications - Sandra Catalán
Universitat Jaume I
10 shared publications - Pedro Alonso
Universitat Politécnica de Valencia, Valencia, Spain
5 shared publications - Cristian Ramírez
Universitat Politècnica de València
3 shared publications
Latest Publications
- Open Access
- 13 April 2026
- Published by Springer Nature in Computing
- Vol. 108 (5) , 66
Sparse matrix–vector product on RISC-V processors with SIMD units
The sparse matrix–vector multiplication ( SpMV ) kernel is a key kernel in scientific and engineering applications, forming the core of many iterative solvers for linear systems and eigenvalue problems. Due to its low arithmetic intensity and irregular memory access patterns, SpMV remains memory-bound on modern architectures, making its efficient implementation particularly challenging. This paper presents vectorized SpMV routines for RISC-V processors with SIMD support, exploiting the RISC-V Vector Extension (RVV 1.0). We implement and evaluate three storage formats—CSR (Compressed Sparse Row), SELL- p (a vector-friendly variant of ELLPACK), and JDS (Jagged Diagonal Storage)—providing low-level implementations that leverage RVV intrinsics. Performance is assessed on two commercial RISC-V platforms (CanMV-K230 and BananaPi F3) with 128-bit and 256-bit vector registers, and on the EPAC research system featuring 16,384-bit vectors. Results show that the vectorized routines significantly outperform scalar baselines, achieving a variety of speed-ups depending on the format and architecture. These findings highlight the potential of open RISC-V architectures for high-performance sparse linear algebra and provide a foundation for future vector-aware sparse kernel optimizations.
- 13 April 2026
- Published by Springer Nature in Computing
- Vol. 108 (5) , 66
Open AccessSparse matrix–vector product on RISC-V processors with SIMD units
The sparse matrix–vector multiplication ( SpMV ) kernel is a key kernel in scientific and engineering applications, forming the core of many iterative solvers for linear systems and eigenvalue problems. Due to its low arithmetic intensity and irregular memory access patterns, SpMV remains memory-bound on modern architectures, making its efficient implementation particularly challenging. This paper presents vectorized SpMV routines for RISC-V processors with SIMD support, exploiting the RISC-V Vector Extension (RVV 1.0). We implement and evaluate three storage formats—CSR (Compressed Sparse Row), SELL- p (a vector-friendly variant of ELLPACK), and JDS (Jagged Diagonal Storage)—providing low-level implementations that leverage RVV intrinsics. Performance is assessed on two commercial RISC-V platforms (CanMV-K230 and BananaPi F3) with 128-bit and 256-bit vector registers, and on the EPAC research system featuring 16,384-bit vectors. Results show that the vectorized routines significantly outperform scalar baselines, achieving a variety of speed-ups depending on the format and architecture. These findings highlight the potential of open RISC-V architectures for high-performance sparse linear algebra and provide a foundation for future vector-aware sparse kernel optimizations.
- Open Access
- 12 February 2026
- Published by Elsevier in SSRN Electronic Journal
Inference Acceleration for Graph Convolutional Networks on RISC-V Systems
Graph Convolutional Networks (GCNs) are a widely used class of Graph Neural Networks for learning on graph-structured data. Despite their shallow architectures, inference with this class of models remains computationally challenging due to the scale and irregularity of real-world graphs, particularly on low-power multicore CPUs. In this paper, we investigate the optimization of GCN inference on RISC-V processor architectures. We evaluate three popular deep learning frameworks, namely DGL, PyTorch Geometric, and PyTorch, using standard citation benchmarks (Cora, PubMed, and CiteSeer) on a Banana Pi BPI-F3 board with an 8-core RISC-V processor. Based on the initial experimental analysis, we develop optimized kernels for the dense and sparse matrix multiplications, showing that these components dominate GCN inference time on low-power CPUs. Finally, we exploit mixed-precision arithmetic in GEMM to reduce memory bandwidth pressure and improve inference throughput. Overall, this work demonstrates the performance benefits of targeted kernel optimizations for efficient GCN inference on low-power multicore processors.
- 12 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessInference Acceleration for Graph Convolutional Networks on RISC-V Systems
Graph Convolutional Networks (GCNs) are a widely used class of Graph Neural Networks for learning on graph-structured data. Despite their shallow architectures, inference with this class of models remains computationally challenging due to the scale and irregularity of real-world graphs, particularly on low-power multicore CPUs. In this paper, we investigate the optimization of GCN inference on RISC-V processor architectures. We evaluate three popular deep learning frameworks, namely DGL, PyTorch Geometric, and PyTorch, using standard citation benchmarks (Cora, PubMed, and CiteSeer) on a Banana Pi BPI-F3 board with an 8-core RISC-V processor. Based on the initial experimental analysis, we develop optimized kernels for the dense and sparse matrix multiplications, showing that these components dominate GCN inference time on low-power CPUs. Finally, we exploit mixed-precision arithmetic in GEMM to reduce memory bandwidth pressure and improve inference throughput. Overall, this work demonstrates the performance benefits of targeted kernel optimizations for efficient GCN inference on low-power multicore processors.
- Open Access
- 25 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 239-246
Migration of Ginkgo's Jacobi-Preconditioned CG Solver to Vector RISC-V
- 25 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 239-246
Open AccessMigration of Ginkgo's Jacobi-Preconditioned CG Solver to Vector RISC-V
- 24 November 2025
- Published by Springer Nature
- p. 431-443
Generation of Mixed-Precision Kernels for Quantized Transformer Encoders with Exo
- 24 November 2025
- Published by Springer Nature
- p. 431-443
Generation of Mixed-Precision Kernels for Quantized Transformer Encoders with Exo
- 24 November 2025
- Published by Springer Nature
- p. 534-547
Evaluation of RVV-Enabled COTS Platforms with Matrix Multiplication and Exo
- 24 November 2025
- Published by Springer Nature
- p. 534-547
Evaluation of RVV-Enabled COTS Platforms with Matrix Multiplication and Exo
- Open Access
- 9 November 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 177
The cambrian explosion of mixed-precision matrix multiplication for quantized deep learning inference
- 9 November 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 177
Open AccessThe cambrian explosion of mixed-precision matrix multiplication for quantized deep learning inference
- Open Access
- 15 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (12) , 1-21
Cache-aware optimization of matrix multiplication and matrix factorizations on multicore processors
This paper advocates for a careful customization of the special general matrix multiplication () kernels that are invoked from blocked routines for several relevant matrix factorizations in LAPACK, in order to improve their performance on modern multicore processors with hierarchical cache memories. To achieve this, we leverage a refined analytical model to dynamically tune the cache configuration parameters of for these kernels, taking into account the matrix operands’ dimensions, in order to improve cache occupation. In addition, toward the same goal, we accommodate a flexible development of architecture-specific micro-kernels for that allows us to select the option that, depending on the operands’ dimensions, ameliorates cache utilization. Our experiments for the LU and QR factorizations on two platforms, equipped with ARM (NVIDIA Carmel) and x86 (AMD EPYC) multi-core processors, demonstrate the benefits of this approach in terms of a better cache utilization and, in general, higher performance. Moreover, they also reveal the delicate balance between optimizing for multi-threaded parallelism versus cache usage as well as the positive effects of software prefetching.
- 15 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (12) , 1-21
Open AccessCache-aware optimization of matrix multiplication and matrix factorizations on multicore processors
This paper advocates for a careful customization of the special general matrix multiplication () kernels that are invoked from blocked routines for several relevant matrix factorizations in LAPACK, in order to improve their performance on modern multicore processors with hierarchical cache memories. To achieve this, we leverage a refined analytical model to dynamically tune the cache configuration parameters of for these kernels, taking into account the matrix operands’ dimensions, in order to improve cache occupation. In addition, toward the same goal, we accommodate a flexible development of architecture-specific micro-kernels for that allows us to select the option that, depending on the operands’ dimensions, ameliorates cache utilization. Our experiments for the LU and QR factorizations on two platforms, equipped with ARM (NVIDIA Carmel) and x86 (AMD EPYC) multi-core processors, demonstrate the benefits of this approach in terms of a better cache utilization and, in general, higher performance. Moreover, they also reveal the delicate balance between optimizing for multi-threaded parallelism versus cache usage as well as the positive effects of software prefetching.
- Open Access
- 13 July 2025
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (6) , 803-821
Characterization of quantized inference with transformer encoders on low power CPUs
Transformers, particularly large language models (LLMs), are revolutionizing applications in natural language processing and computer vision but at a high cost in memory, energy, and computational resources. Quantization has emerged as an effective compression method to alleviate these demands, reducing the bitwidth of model data and arithmetic precision to enable efficient inference on resource-constrained devices. This paper focuses on optimizing inference with transformer encoders on low-power general-purpose CPUs, as those often found in edge devices. Our key contributions include exposing the critical role of linear layers within transformer encoders on CPUs with a limited number of cores; developing mixed integer precision matrix multiplication on ARM and RISC-V CPUs; and evaluating performance impact and energy savings of quantized inference. In summary, this work highlights the advantages of applying quantization to transformer encoders on current single-core and multi-core low power CPUs, offering insights for efficient LLM deployment on edge platforms.
- 13 July 2025
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (6) , 803-821
Open AccessCharacterization of quantized inference with transformer encoders on low power CPUs
Transformers, particularly large language models (LLMs), are revolutionizing applications in natural language processing and computer vision but at a high cost in memory, energy, and computational resources. Quantization has emerged as an effective compression method to alleviate these demands, reducing the bitwidth of model data and arithmetic precision to enable efficient inference on resource-constrained devices. This paper focuses on optimizing inference with transformer encoders on low-power general-purpose CPUs, as those often found in edge devices. Our key contributions include exposing the critical role of linear layers within transformer encoders on CPUs with a limited number of cores; developing mixed integer precision matrix multiplication on ARM and RISC-V CPUs; and evaluating performance impact and energy savings of quantized inference. In summary, this work highlights the advantages of applying quantization to transformer encoders on current single-core and multi-core low power CPUs, offering insights for efficient LLM deployment on edge platforms.
- Open Access
- 14 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 25676-25690
Latency-Critical Quantized Inference With Transformer Decoders on ARM and RISC-V CPUs
Large language models are transforming industries but face challenges due to their high computational and energy demands. Model compression via quantization mitigates these barriers by reducing the bit precision of parameters and arithmetic operations, enabling deployment on resource-constrained devices like smartphones and edge platforms. This article focuses on quantization applied to transformer decoders, which are critical for tasks, such as text generation and conversational artificial intelligence. Unlike encoders, decoders are constrained by memory due to their sequential processing nature and low arithmetic intensity. We propose optimizations targeting inference on low-power CPUs, emphasizing efficient linear layers with quantized data/arithmetic and cache optimization. Using two representative ARM and RISC-V platforms, we present optimized mixed-precision implementations of the matrix multiplication that outperform the instance of that computational kernel in popular libraries, such as basic linear algebra subprograms infrastructure software, XNNPACK and ARMCL. This work thus advances the understanding of the impact of quantization on transformer decoder efficiency, energy consumption and precision in edge environments.
- 14 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 25676-25690
Open AccessLatency-Critical Quantized Inference With Transformer Decoders on ARM and RISC-V CPUs
Large language models are transforming industries but face challenges due to their high computational and energy demands. Model compression via quantization mitigates these barriers by reducing the bit precision of parameters and arithmetic operations, enabling deployment on resource-constrained devices like smartphones and edge platforms. This article focuses on quantization applied to transformer decoders, which are critical for tasks, such as text generation and conversational artificial intelligence. Unlike encoders, decoders are constrained by memory due to their sequential processing nature and low arithmetic intensity. We propose optimizations targeting inference on low-power CPUs, emphasizing efficient linear layers with quantized data/arithmetic and cache optimization. Using two representative ARM and RISC-V platforms, we present optimized mixed-precision implementations of the matrix multiplication that outperform the instance of that computational kernel in popular libraries, such as basic linear algebra subprograms infrastructure software, XNNPACK and ARMCL. This work thus advances the understanding of the impact of quantization on transformer decoder efficiency, energy consumption and precision in edge environments.
- 14 December 2024
- Published by Springer Nature
- p. 325-338
Performance Analysis of BERT on RISC-V Processors with SIMD Units
- 14 December 2024
- Published by Springer Nature
- p. 325-338
Performance Analysis of BERT on RISC-V Processors with SIMD Units