CAT: Cellular Automata on Tensor Cores

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 <inline-formula><tex-math notation="LaTeX">$1 \leq r \leq 16$</tex-math></inline-formula>, and its theoretical speedups agree with the empirical results. At low radius <inline-formula><tex-math notation="LaTeX">$r=1,2$</tex-math></inline-formula>, CAT is competitive and is only surpassed by the fastest state-of-the-art GPU solution. Starting from <inline-formula><tex-math notation="LaTeX">$r=3$</tex-math></inline-formula>, CAT progressively outperforms all other approaches, reaching speedups of up to <inline-formula><tex-math notation="LaTeX">$101\times$</tex-math></inline-formula> over a GPU baseline and up to <inline-formula><tex-math notation="LaTeX">$\sim \!14\times$</tex-math></inline-formula> over the fastest state-of-the-art GPU approach. In terms of energy efficiency, CAT is competitive in the range <inline-formula><tex-math notation="LaTeX">$1 \leq r \leq 4$</tex-math></inline-formula> and from <inline-formula><tex-math notation="LaTeX">$r \geq 5$</tex-math></inline-formula> 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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Parallel and Distributed Systems
Published
2024-12-20
DOI
https://doi.org/10.1109/tpds.2024.3520395
Primary Topic
Cellular Automata and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CAT: Cellular Automata on Tensor Cores

Enzo Meneses, Felipe A. Quezada, Nancy Hitschfeld, Héctor Ferrada et al.
IEEE Transactions on Parallel and Distributed Systems
Cellular Automata and Applications
article

CAT: Cellular Automata on Tensor Cores

Enzo Meneses, Felipe A. Quezada, Nancy Hitschfeld, Héctor Ferrada, Cristóbal A. Navarro
article en

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 <inline-formula><tex-math notation="LaTeX">$1 \leq r \leq 16$</tex-math></inline-formula>, and its theoretical speedups agree with the empirical results. At low radius <inline-formula><tex-math notation="LaTeX">$r=1,2$</tex-math></inline-formula>, CAT is competitive and is only surpassed by the fastest state-of-the-art GPU solution. Starting from <inline-formula><tex-math notation="LaTeX">$r=3$</tex-math></inline-formula>, CAT progressively outperforms all other approaches, reaching speedups of up to <inline-formula><tex-math notation="LaTeX">$101\times$</tex-math></inline-formula> over a GPU baseline and up to <inline-formula><tex-math notation="LaTeX">$\sim \!14\times$</tex-math></inline-formula> over the fastest state-of-the-art GPU approach. In terms of energy efficiency, CAT is competitive in the range <inline-formula><tex-math notation="LaTeX">$1 \leq r \leq 4$</tex-math></inline-formula> and from <inline-formula><tex-math notation="LaTeX">$r \geq 5$</tex-math></inline-formula> 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.

IEEE Transactions on Parallel and Distributed SystemsVol. 36(2)
Austral University of Chile (CL), University of Chile (CL)
Affordable and clean energy
Openalex Percentile: Top 72%
Cellular Automata and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.