Parallel path tracing using incoherent path-atom binning

David Coulthurst*, Piotr Dubla, Kurt Debattista, Simon McIntosh-Smith, Alan Chalmers

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

Abstract

Current parallel graphics algorithms minimise memory access latency by tracing packets of coherent rays. This coherency, however, breaks down after several bounces, and is unsuited to acceleration techniques such as selective rendering. This paper presents an unbiased path tracing algorithm which is insensitive to the coherency of the rays traced, allowing it to run on diverse architectures including massively SIMD processors. Bins of path-atoms are created and processed to form a path tracing circular buffer. Latency is hidden by n-buffering the load/save operations between bins. We demonstrate our approach as an implementation on the massively parallel SIMD architecture, the ClearSpeed CSX600.

Original languageEnglish
Title of host publicationProceedings - SCCG 2008: 24th Spring Conference on Computer Graphics
Pages91-96
Number of pages6
DOIs
Publication statusPublished - 1 Dec 2010
Event24th Spring Conference on Computer Graphics, SCCG 2008 - Budmerice, United Kingdom
Duration: 21 Apr 200823 Apr 2008

Conference

Conference24th Spring Conference on Computer Graphics, SCCG 2008
CountryUnited Kingdom
CityBudmerice
Period21/04/0823/04/08

Keywords

  • Global illumination
  • Parallel graphics
  • Path tracing

Fingerprint Dive into the research topics of 'Parallel path tracing using incoherent path-atom binning'. Together they form a unique fingerprint.

Cite this