Basilio Fraguela

Prof. Basilio Fraguela

Universidade da Coruña
+1
orcid

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 March 2006
Verified
Conference Paper
Open access
PDF file
GBGanesh Bikshandi
Ganesh Bikshandi
JGJia Guo
Jia Guo
DHDaniel Hoeflinger
Daniel Hoeflinger
GAGheorghe Almasi
Gheorghe Almasi
BFBasilio Fraguela
Basilio Fraguela
CPChristoph von Praun
Christoph von Praun

1 January 2009
Verified
Book Chapter
Closed access
PDF file
DMDamián A. Mallón
Damián A. Mallón
Guillermo Lopez TaboadaGuillermo Lopez Taboada
Guillermo Lopez Taboada
CTCarlos Teijeiro
Carlos Teijeiro
JTJuan Touriño
Juan Touriño
BFBasilio Fraguela
Basilio Fraguela
JMJ. Carlos Mouriño
J. Carlos Mouriño

20 January 2003
Verified
Conference Paper
Closed access
BFBasilio Fraguela
Basilio Fraguela
RDR. Doallo
R. Doallo
EZE.L. Zapata
E.L. Zapata
Caches play a very important role in the performance of modern computer systems due to the gap between the memory and the processor speed. Among the methods for studying their behavior, the most widely used by now has been trace-driven simulation. Nevertheless, analytical modeling gives more information and requires smaller computation times that allow it to be used in the compilation step to drive automatic optimizations on the code. The traditional drawback of analytical modeling has been its limited precision and the lack of techniques to apply it systematically without user intervention. In this work we present a methodology to build analytical models for codes with regular access patterns. These models can be applied to caches with an arbitrary size, line size and associativity. Their validation through simulations using typical scientific code fragments has proved a good degree of accuracy.

12 December 2009
Verified
Conference Paper
Open access
PDF file
DRDyer Rolán
Dyer Rolán
BFBasilio Fraguela
Basilio Fraguela
RDRamón Doallo
Ramón Doallo
Efficient memory hierarchy design is critical due to the increasing gap between the speed of the processors and the memory. One of the sources of inefficiency in current caches is the non-uniform distribution of the memory accesses on the cache sets. Its consequence is that while some cache sets may have working sets that are far from fitting in them, other sets may be underutilized because their working set has fewer lines than the set. In this paper we present a technique that aims to balance the pressure on the cache sets by detecting when it may be beneficial to associate sets, displacing lines from stressed sets to underutilized ones. This new technique, called Set Balancing Cache or SBC, achieved an average reduction of 13% in the miss rate of ten benchmarks from the SPEC CPU2006 suite, resulting in an average IPC improvement of 5%.

11 November 2023
Verified
Conference Paper
Open access
RCRoberto López Castro
Roberto López Castro
AIAndrei Ivanov
Andrei Ivanov
DADiego Andrade
Diego Andrade
TBTal Ben-Nun
Tal Ben-Nun
BFBasilio Fraguela
Basilio Fraguela
THTorsten Hoefler
Torsten Hoefler
The increasing success and scaling of Deep Learning models demands higher computational efficiency and power. Sparsification can lead to both smaller models as well as higher compute efficiency, and accelerated hardware is becoming available. However, exploiting it efficiently requires kernel implementations, pruning algorithms, and storage formats, to utilize hardware support of specialized sparse vector units. An example of those are the NVIDIA's Sparse Tensor Cores (SPTCs), which promise a 2× speedup. However, SPTCs only support the 2:4 format, limiting achievable sparsity ratios to 50%. We present the V:N:M format, which enables the execution of arbitrary N:M ratios on SPTCs. To efficiently exploit the resulting format, we propose Spatha, a high-performance sparse-library for DL routines. We show that Spatha achieves up to 37× speedup over cuBLAS. We also demonstrate a second-order pruning technique that enables sparsification to high sparsity ratios with V:N:M and little to no loss in accuracy in modern transformers.

20 February 2008
Verified
Conference Paper
Open access
PDF file
JGJia Guo
Jia Guo
GBGanesh Bikshandi
Ganesh Bikshandi
BFBasilio Fraguela
Basilio Fraguela
MGMaria J. Garzaran
Maria J. Garzaran
DPDavid Padua
David Padua