Zobrazeno 1 - 10
of 183
pro vyhledávání: '"Igual, Francisco D."'
We present a family of policies that, integrated within a runtime task scheduler (Nanox), pursue the goal of improving the energy efficiency of task-parallel executions with no intervention from the programmer. The proposed policies tackle the proble
Externí odkaz:
http://arxiv.org/abs/2402.06319
Publikováno v:
Journal of Supercomputing 76, pp. 9388 to 9403 (2020)
The coexistence of parallel applications in shared computing nodes, each one featuring different Quality of Service (QoS) requirements, carries out new challenges to improve resource occupation while keeping acceptable rates in terms of QoS. As more
Externí odkaz:
http://arxiv.org/abs/2402.04891
Autor:
Corpas, Alberto, Costero, Luis, Botella, Guillermo, Igual, Francisco D., García, Carlos, Rodríguez, Manuel
Publikováno v:
International Journal of Circuit Theory and Applications. 2018. 46, pp 1756 1776
This paper proposes a mechanism to accelerate and optimize the energy consumption of a face detection software based on Haar-like cascading classifiers, taking advantage of the features of low-cost Asymmetric Multicore Processors (AMPs) with limited
Externí odkaz:
http://arxiv.org/abs/2402.04090
Autor:
Alaejos, Guillermo, Castelló, Adrián, Alonso-Jordá, Pedro, Igual, Francisco D., Martínez, Héctor, Quintana-Ortí, Enrique S.
We explore the utilization of the Apache TVM open source framework to automatically generate a family of algorithms that follow the approach taken by popular linear algebra libraries, such as GotoBLAS2, BLIS and OpenBLAS, in order to obtain high-perf
Externí odkaz:
http://arxiv.org/abs/2310.20347
Autor:
Martínez, Héctor, Catalán, Sandra, Igual, Francisco D., Herrero, José R., Rodríguez-Sánchez, Rafael, Quintana-Ortí, Enrique S.
This paper advocates for an intertwined design of the dense linear algebra software stack that breaks down the strict barriers between the high-level, blocked algorithms in LAPACK (Linear Algebra PACKage) and the low-level, architecture-dependent ker
Externí odkaz:
http://arxiv.org/abs/2304.14480
The minimum distance of a linear code is a key concept in information theory. Therefore, the time required by its computation is very important to many problems in this area. In this paper, we introduce a family of implementations of the Brouwer-Zimm
Externí odkaz:
http://arxiv.org/abs/1911.08963
Cache timing attacks use shared caches in multi-core processors as side channels to extract information from victim processes. These attacks are particularly dangerous in cloud infrastructures, in which the deployed countermeasures cause collateral e
Externí odkaz:
http://arxiv.org/abs/1904.11268
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Programming parallel dense matrix factorizations and inversion for new-generation NUMA architectures
Autor:
Catalán, Sandra, Igual, Francisco D., Herrero, José R., Rodríguez-Sánchez, Rafael, Quintana-Ortí, Enrique S.
Publikováno v:
In Journal of Parallel and Distributed Computing May 2023 175:51-65
Autor:
Catalán, Sandra, Castelló, Adrián, Igual, Francisco D., Rodríguez-Sánchez, Rafael, Quintana-Ortí, Enrique S.
We investigate a parallelization strategy for dense matrix factorization (DMF) algorithms, using OpenMP, that departs from the legacy (or conventional) solution, which simply extracts concurrency from a multithreaded version of BLAS. This approach is
Externí odkaz:
http://arxiv.org/abs/1804.07017