Real-Time Concurrent Linked List Construction on the GPU

We introduce a method to dynamically construct highly concurrent linked lists on modern graphics processors. Once constructed, these data structures can be used to implement a host of algorithms useful in creating complex rendering effects in real time. We present a straightforward way to create the...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum Vol. 29; no. 4; pp. 1297 - 1304
Main Authors: Yang, Jason C., Hensley, Justin, Grün, Holger, Thibieroz, Nicolas
Format: Journal Article
Language:English
Published: Oxford, UK Blackwell Publishing Ltd 01.06.2010
Subjects:
Algorithms
API
Blending
C (programming language)
Central processing units
Computer graphics
Construction
CPUs
Dynamic programming
I.3.6 [Computer Graphics]: Methodology and Techniques-Graphics data structures and data types
Lists
Real time
Rendering
Shadows
Studies
ISSN:0167-7055, 1467-8659
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce a method to dynamically construct highly concurrent linked lists on modern graphics processors. Once constructed, these data structures can be used to implement a host of algorithms useful in creating complex rendering effects in real time. We present a straightforward way to create these linked lists using generic atomic operations available in APIs such as OpenGL 4.0 and DirectX 11. We also describe several possible applications of our algorithm. One example uses per‐pixel linked lists for order‐independent transparency; as a consequence, we are able to directly implement fully programmable blending, which frees developers from the restrictions imposed by current graphics APIs. The second uses linked lists to implement real‐time indirect shadows.
Bibliography:ark:/67375/WNG-L8F0FRL3-B
ArticleID:CGF1725
istex:1C1101EC321296D63FA71749721F91181D197943
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ISSN:0167-7055
1467-8659
DOI:10.1111/j.1467-8659.2010.01725.x