Rafael Rodríguez-Sánchez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Rafael Rodríguez-Sánchez has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
- Enrique S. Quintana Orti
Universitat Politécnica de Valencia, Valencia, Spain
27 shared publications - Sandra Catalán
Universitat Jaume I
23 shared publications - Francisco D. Igual
Universidad Complutense de Madrid
14 shared publications - José Luis Martínez
University of Castilla-La Mancha
14 shared publications - Jose Manuel Claver
Universitat de València
9 shared publications - José Luis Sánchez
Universidad de Castilla-La Mancha
9 shared publications
Latest Publications
- Open Access
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Consumer Electronics Magazine
- Vol. 15 (6) , 54-70
Comparing V-Nova LCEVC SDK With Practical Open Source Video Codecs
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Consumer Electronics Magazine
- Vol. 15 (6) , 54-70
Open AccessComparing V-Nova LCEVC SDK With Practical Open Source Video Codecs
- Open Access
- 24 January 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 180
A comparative performance and efficiency analysis of Apple’s M architectures: A GEMM case study
- 24 January 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 180
Open AccessA comparative performance and efficiency analysis of Apple’s M architectures: A GEMM case study
- Open Access
- 10 March 2023
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 38 (2) , 55-68
Experiences with nested parallelism in task-parallel applications using malleable BLAS on multicore processors
Malleability is defined as the ability to vary the degree of parallelism at runtime, and is regarded as a means to improve core occupation on state-of-the-art multicore processors tshat contain tens of computational cores per socket. This property is especially interesting for applications consisting of irregular workloads and/or divergent executions paths. The integration of malleability in high-performance instances of the Basic Linear Algebra Subprograms (BLAS) is currently nonexistent, and, in consequence, applications relying on these computational kernels cannot benefit from this capability. In response to this scenario, in this paper we demonstrate that significant performance benefits can be gathered via the exploitation of malleability in a framework designed to implement portable and high-performance BLAS-like operations. For this purpose, we integrate malleability within the BLIS library, and provide an experimental evaluation of the result on three different practical use cases.
- 10 March 2023
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 38 (2) , 55-68
Open AccessExperiences with nested parallelism in task-parallel applications using malleable BLAS on multicore processors
Malleability is defined as the ability to vary the degree of parallelism at runtime, and is regarded as a means to improve core occupation on state-of-the-art multicore processors tshat contain tens of computational cores per socket. This property is especially interesting for applications consisting of irregular workloads and/or divergent executions paths. The integration of malleability in high-performance instances of the Basic Linear Algebra Subprograms (BLAS) is currently nonexistent, and, in consequence, applications relying on these computational kernels cannot benefit from this capability. In response to this scenario, in this paper we demonstrate that significant performance benefits can be gathered via the exploitation of malleability in a framework designed to implement portable and high-performance BLAS-like operations. For this purpose, we integrate malleability within the BLIS library, and provide an experimental evaluation of the result on three different practical use cases.
- 1 January 2022
- Published by Springer Nature
- p. 176-189
QR Factorization Using Malleable BLAS on Multicore Processors
- 1 January 2022
- Published by Springer Nature
- p. 176-189
QR Factorization Using Malleable BLAS on Multicore Processors
- Open Access
- 22 March 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (10) , 11257-11269
Low precision matrix multiplication for efficient deep learning in NVIDIA Carmel processors
- 22 March 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (10) , 11257-11269
Open AccessLow precision matrix multiplication for efficient deep learning in NVIDIA Carmel processors
- 14 November 2019
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 76 (4) , 2860-2875
Integration and exploitation of intra-routine malleability in BLIS
- 14 November 2019
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 76 (4) , 2860-2875
Integration and exploitation of intra-routine malleability in BLIS
- 2 April 2019
- Published by Springer Nature in Cluster Computing
- Vol. 23 (1) , 359-375
Programming parallel dense matrix factorizations with look-ahead and OpenMP
- 2 April 2019
- Published by Springer Nature in Cluster Computing
- Vol. 23 (1) , 359-375
Programming parallel dense matrix factorizations with look-ahead and OpenMP
- Open Access
- 31 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 17617-17633
A Case for Malleable Thread-Level Linear Algebra Libraries: The LU Factorization With Partial Pivoting
We propose two novel techniques for overcoming load-imbalance encountered when implementing so-called look-ahead mechanisms in relevant dense matrix factorizations for the solution of linear systems. Both techniques target the scenario where two thread teams are created/activated during the factorization, with each team in charge of performing an independent task/branch of execution. The first technique promotes worker sharing (WS) between the two tasks, allowing the threads of the task that completes first to be reallocated for use by the costlier task. The second technique allows a fast task to alert the slower task of completion, enforcing the early termination (ET) of the second task, and a smooth transition of the factorization procedure into the next iteration. The two mechanisms are instantiated via a new malleable thread-level implementation of the basic linear algebra subprograms, and their benefits are illustrated via an implementation of the LU factorization with partial pivoting enhanced with look-ahead. Concretely, our experimental results on an Intel-Xeon system with 12 cores show the benefits of combining WS+ET, reporting competitive performance in comparison with a task-parallel runtime-based solution.
- 31 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 17617-17633
Open AccessA Case for Malleable Thread-Level Linear Algebra Libraries: The LU Factorization With Partial Pivoting
We propose two novel techniques for overcoming load-imbalance encountered when implementing so-called look-ahead mechanisms in relevant dense matrix factorizations for the solution of linear systems. Both techniques target the scenario where two thread teams are created/activated during the factorization, with each team in charge of performing an independent task/branch of execution. The first technique promotes worker sharing (WS) between the two tasks, allowing the threads of the task that completes first to be reallocated for use by the costlier task. The second technique allows a fast task to alert the slower task of completion, enforcing the early termination (ET) of the second task, and a smooth transition of the factorization procedure into the next iteration. The two mechanisms are instantiated via a new malleable thread-level implementation of the basic linear algebra subprograms, and their benefits are illustrated via an implementation of the LU factorization with partial pivoting enhanced with look-ahead. Concretely, our experimental results on an Intel-Xeon system with 12 cores show the benefits of combining WS+ET, reporting competitive performance in comparison with a task-parallel runtime-based solution.
- 1 January 2019
- Published by Elsevier in Parallel Computing
- Vol. 81, 22-31
Dynamic look-ahead in the reduction to band form for the singular value decomposition
- 1 January 2019
- Published by Elsevier in Parallel Computing
- Vol. 81, 22-31
Dynamic look-ahead in the reduction to band form for the singular value decomposition
- Open Access
- 1 October 2018
- Published by Elsevier in Parallel Computing
- Vol. 78, 85-100
Two-sided orthogonal reductions to condensed forms on asymmetric multicore processors
- 1 October 2018
- Published by Elsevier in Parallel Computing
- Vol. 78, 85-100
Open AccessTwo-sided orthogonal reductions to condensed forms on asymmetric multicore processors