Path Regeneration for Random Walks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00173994" target="_blank" >RIV/68407700:21230/11:00173994 - isvavai.cz</a>

Výsledek na webu

<a href="http://mkp.com/news/gpu-computing-gems-edited-by-wen-mei-w-hwu" target="_blank" >http://mkp.com/news/gpu-computing-gems-edited-by-wen-mei-w-hwu</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Path Regeneration for Random Walks

Popis výsledku v původním jazyce

In this chapter, we present a method for efficiently generating random walks on the GPU. We analyze the main drawback of naive random walk generators resulting in low GPU utilization over time, and propose an intuitive scheme for keeping all the processing units busy during the entire computation. The algorithm does not require inter-thread communication, collective operations, or intricate handling of work queues. Instead, full utilization is achieved by intelligently regenerating terminated walks. Wediscuss our optimization in the context of rendering global illumination images where random walks are used to compute the propagation of energy between light sources and cameras. Algorithms such as (bidirectional) path tracing, photon mapping, and irradiance caching directly benefit from the higher throughput; however, our technique is also applicable to non-graphical problems that explore the domain of interest by random walks.

Název v anglickém jazyce

Path Regeneration for Random Walks

Popis výsledku anglicky

In this chapter, we present a method for efficiently generating random walks on the GPU. We analyze the main drawback of naive random walk generators resulting in low GPU utilization over time, and propose an intuitive scheme for keeping all the processing units busy during the entire computation. The algorithm does not require inter-thread communication, collective operations, or intricate handling of work queues. Instead, full utilization is achieved by intelligently regenerating terminated walks. Wediscuss our optimization in the context of rendering global illumination images where random walks are used to compute the propagation of energy between light sources and cameras. Algorithms such as (bidirectional) path tracing, photon mapping, and irradiance caching directly benefit from the higher throughput; however, our technique is also applicable to non-graphical problems that explore the domain of interest by random walks.

Druh

C - Kapitola v odborné knize

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2011

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 knihy nebo sborníku

GPU Computing Gems, Emerald Edition

ISBN

978-0-12-384988-5

Počet stran výsledku

12

Strana od-do

401-412

Počet stran knihy

840

Název nakladatele

Morgan Kaufmann Publishers

Místo vydání

San Francisco

Kód UT WoS kapitoly

—