Felipe A. Quezada

dblp:263/9859 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
6since 2021 · last 2026
0000-0002-3384-2840ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 7 · 2 first-author · 6 since 2021
YearPublicationVenuePosition
2026 Advancing RT core-accelerated fixed-radius nearest neighbor search
Enzo Meneses, Hugo Bec, Cristóbal A. Navarro, Benoît Crespin, Felipe A. Quezada, Nancy Hitschfeld-Kahler, Heinich Porro, Maxime Maria
Future Gener. Comput. Syst.5
2025 CAT: Cellular Automata on Tensor Cores
abstract
Cellular automata (CA) are simulation models that can produce complex emergent behaviors from simple local rules. Although state-of-the-art GPU solutions are already fast due to their data-parallel nature, their performance can rapidly degrade in CA with a large neighborhood radius. With the inclusion of tensor cores across the entire GPU ecosystem, interest has grown in finding ways to leverage these fast units outside the field of artificial intelligence, which was their original purpose. In this work, we present CAT, a GPU tensor core approach that can accelerate CA in which the cell transition function acts on a weighted summation of its neighborhood. CAT is evaluated theoretically, using an extended PRAM cost model, as well as empirically using the Larger Than Life (LTL) family of CA as case studies. The results confirm that the cost model is accurate, showing that CAT exhibits constant time throughout the entire radius range$1 \leq r \leq 16$, and its theoretical speedups agree with the empirical results. At low radius$r=1,2$, CAT is competitive and is only surpassed by the fastest state-of-the-art GPU solution. Starting from$r=3$, CAT progressively outperforms all other approaches, reaching speedups of up to$101\times$over a GPU baseline and up to$\sim \!14\times$over the fastest state-of-the-art GPU approach. In terms of energy efficiency, CAT is competitive in the range$1 \leq r \leq 4$and from$r \geq 5$it is the most energy efficient approach. As for performance scaling across GPU architectures, CAT shows a promising trend that, if continues for future generations, it would increase its performance at a higher rate than classical GPU solutions. A CPU version of CAT was also explored, using the recently introduced AMX instructions. Although its performance is still below GPU tensor cores, it is a promising approach as it can still outperform some GPU approaches at large radius. The results obtained in this work put CAT as an approach with great potential for scientists who need to study emerging phenomena in CA with a large neighborhood radius, both in the GPU and in the CPU.
Cristóbal A. Navarro, Felipe A. Quezada, Enzo Meneses, Héctor Ferrada, Nancy Hitschfeld-Kahler
IEEE Trans. Parallel Distributed Syst.2
2024 Accelerating range minimum queries with ray tracing cores
Enzo Meneses, Cristóbal A. Navarro, Héctor Ferrada, Felipe A. Quezada
Future Gener. Comput. Syst.4
2023 A scalable and energy efficient GPU thread map for m-simplex domains
Cristóbal A. Navarro, Felipe A. Quezada, Benjamin Bustos, Nancy Hitschfeld-Kahler, Rolando Kindelan
Future Gener. Comput. Syst.2
2023 Modeling GPU Dynamic Parallelism for self similar density workloads
Felipe A. Quezada, Cristóbal A. Navarro, Miguel Romero 0001
Future Gener. Comput. Syst.1
2022 Squeeze: Efficient compact fractals for tensor core GPUs
Felipe A. Quezada, Cristóbal A. Navarro, Nancy Hitschfeld-Kahler, Benjamin Bustos
Future Gener. Comput. Syst.1
2020 Efficient GPU thread mapping on embedded 2D fractals
Cristóbal A. Navarro, Felipe A. Quezada, Nancy Hitschfeld-Kahler, Raimundo Vega, Benjamin Bustos
Future Gener. Comput. Syst.2