Slaying a Life: Optimizing GPU-accelerated Game of Life Stencil

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10502184" target="_blank" >RIV/00216208:11320/25:10502184 - isvavai.cz</a>

Výsledek na webu

<a href="https://ieeexplore.ieee.org/document/11106100" target="_blank" >https://ieeexplore.ieee.org/document/11106100</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/IPDPSW66978.2025.00010" target="_blank" >10.1109/IPDPSW66978.2025.00010</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Slaying a Life: Optimizing GPU-accelerated Game of Life Stencil

Popis výsledku v původním jazyce

Iterative stencil loops (ISL) form a specific group of algorithms widely employed in simulations, image processing, or cellular automata. In this paper, we focus on Conway&apos;s Game of Life, a zero-player game implemented by a stencil that uses a 2D grid of bool values indicating whether a cell contains a live organism. This stencil is suitable for data-parallel processing on GPUs; however, we discovered that current state-of-the-art implementations are suboptimal and can be improved. Furthermore, we use this stencil as a proof of concept for our proposed optimization technique that eliminates unnecessary computations on the areas of the grid that did not change in the last iteration. Our implementation based on more efficient bitwise encoding and the work-reduction optimization exhibits 22.8x speedup over a baseline GPU implementation and 7.5x speedup over the state-of-the-art packet-coding method. Compared to the code generated by the state-of-the-art AN5D framework, our solution is 19.1x faster.

Název v anglickém jazyce

Slaying a Life: Optimizing GPU-accelerated Game of Life Stencil

Popis výsledku anglicky

Iterative stencil loops (ISL) form a specific group of algorithms widely employed in simulations, image processing, or cellular automata. In this paper, we focus on Conway&apos;s Game of Life, a zero-player game implemented by a stencil that uses a 2D grid of bool values indicating whether a cell contains a live organism. This stencil is suitable for data-parallel processing on GPUs; however, we discovered that current state-of-the-art implementations are suboptimal and can be improved. Furthermore, we use this stencil as a proof of concept for our proposed optimization technique that eliminates unnecessary computations on the areas of the grid that did not change in the last iteration. Our implementation based on more efficient bitwise encoding and the work-reduction optimization exhibits 22.8x speedup over a baseline GPU implementation and 7.5x speedup over the state-of-the-art packet-coding method. Compared to the code generated by the state-of-the-art AN5D framework, our solution is 19.1x faster.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/EH22_008%2F0004605" target="_blank" >EH22_008/0004605: Přírodní a antropogenní georizika</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

2025 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)

ISBN

979-8-3315-2643-6

ISSN

2995-066X

e-ISSN

—

Počet stran výsledku

10

Strana od-do

15-24

Název nakladatele

IEEE

Místo vydání

New York, NY

Místo konání akce

Milano, Italy

Datum konání akce

3. 6. 2025

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

001566005900002