Exploring the Spectrum of Dynamic Scheduling Algorithms for Scalable Distributed-MemoryRay Tracing

This paper extends and evaluates a family of dynamic ray scheduling algorithms that can be performed in-situ on large distributed memory parallel computers. The key idea is to consider both ray state and data accesses when scheduling ray computations. We compare three instances of this family of alg...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics Jg. 20; H. 6; S. 893 - 906
Hauptverfasser: Navrátil, Paul A., Childs, Hank, Fussell, Donald S., Lin, Calvin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: United States IEEE 01.06.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Aggregates
Algorithms
Coherence
Distributed memory
Dynamic scheduling
Dynamic tests
Dynamical systems
Dynamics
Lighting
parallel
Parallel computers
Processor scheduling
Ray tracing
Rendering (computer graphics)
Schedules
Scheduling
ISSN:1077-2626, 1941-0506
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper extends and evaluates a family of dynamic ray scheduling algorithms that can be performed in-situ on large distributed memory parallel computers. The key idea is to consider both ray state and data accesses when scheduling ray computations. We compare three instances of this family of algorithms against two traditional statically scheduled schemes. We show that our dynamic scheduling approach can render data sets that are larger than aggregate system memory and that cannot be rendered by existing statically scheduled ray tracers. For smaller problems that fit in aggregate memory but are larger than typical shared memory, our dynamic approach is competitive with the best static scheduling algorithm.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1077-2626
1941-0506
DOI:10.1109/TVCG.2013.261