Parallel path tracing using incoherent path-atom binning

David J Coulthurst, Piotr B Dubla, Kurt Debattista, Simon N McIntosh-Smith, Alan G Chalmers

Research output: Contribution to conferenceConference Paperpeer-review


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
Publication statusPublished - 23 Apr 2008
Event24th Spring conference on computer graphics (SCCG '08) - New York, United States
Duration: 1 Mar 2008 → …


Conference24th Spring conference on computer graphics (SCCG '08)
Country/TerritoryUnited States
CityNew York
Period1/03/08 → …


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

Cite this