Data Parallel Multi-GPU Path Tracing using Ray Queue Cycling

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F23%3A10253388" target="_blank" >RIV/61989100:27740/23:10253388 - isvavai.cz</a>

Výsledek na webu

<a href="https://onlinelibrary.wiley.com/doi/10.1111/cgf.14873" target="_blank" >https://onlinelibrary.wiley.com/doi/10.1111/cgf.14873</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1111/cgf.14873" target="_blank" >10.1111/cgf.14873</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Data Parallel Multi-GPU Path Tracing using Ray Queue Cycling

Popis výsledku v původním jazyce

We propose a novel approach to data-parallel path tracing on single-node/multi-GPU hardware that builds on ray forwarding, but which aims-above all else-at generality and practicability. We do this by avoiding any attempts at reducing the number of traces or forward operations performed, and instead focus on always using all GPUs&apos; aggregate compute and bandwidth to effectively trace each ray on every GPU. We show that-counter-intuitively-this is both feasible and desirable; and that when run on typical data-center/cloud hardware, the resulting framework not only achieves good performance and scalability, but also comes with significantly fewer limitations, assumptions, or preprocessing requirements than existing techniques.

Název v anglickém jazyce

Data Parallel Multi-GPU Path Tracing using Ray Queue Cycling

Popis výsledku anglicky

We propose a novel approach to data-parallel path tracing on single-node/multi-GPU hardware that builds on ray forwarding, but which aims-above all else-at generality and practicability. We do this by avoiding any attempts at reducing the number of traces or forward operations performed, and instead focus on always using all GPUs&apos; aggregate compute and bandwidth to effectively trace each ray on every GPU. We show that-counter-intuitively-this is both feasible and desirable; and that when run on typical data-center/cloud hardware, the resulting framework not only achieves good performance and scalability, but also comes with significantly fewer limitations, assumptions, or preprocessing requirements than existing techniques.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

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

Projekt

—

Návaznosti

—

Rok uplatnění

2023

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 periodika

Computer Graphics Forum

ISSN

0167-7055

e-ISSN

1467-8659

Svazek periodika

42

Číslo periodika v rámci svazku

8

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

11

Strana od-do

—

Kód UT WoS článku

001041122900001

EID výsledku v databázi Scopus

2-s2.0-85166633782