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

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 20(2014), 6 vom: 10. Juni, Seite 893-906
1. Verfasser: Navrátil, Paul A (VerfasserIn)
Weitere Verfasser: Childs, Hank, Fussell, Donald S, Lin, Calvin
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2014
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article Research Support, U.S. Gov't, Non-P.H.S.
LEADER 01000naa a22002652 4500
001 NLM252630475
003 DE-627
005 20231224164522.0
007 cr uuu---uuuuu
008 231224s2014 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2013.261  |2 doi 
028 5 2 |a pubmed24n0842.xml 
035 |a (DE-627)NLM252630475 
035 |a (NLM)26357306 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Navrátil, Paul A  |e verfasserin  |4 aut 
245 1 0 |a Exploring the Spectrum of Dynamic Scheduling Algorithms for Scalable Distributed-MemoryRay Tracing 
264 1 |c 2014 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 02.12.2015 
500 |a Date Revised 11.09.2015 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 
650 4 |a Journal Article 
650 4 |a Research Support, U.S. Gov't, Non-P.H.S. 
700 1 |a Childs, Hank  |e verfasserin  |4 aut 
700 1 |a Fussell, Donald S  |e verfasserin  |4 aut 
700 1 |a Lin, Calvin  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 20(2014), 6 vom: 10. Juni, Seite 893-906  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:20  |g year:2014  |g number:6  |g day:10  |g month:06  |g pages:893-906 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2013.261  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 20  |j 2014  |e 6  |b 10  |c 06  |h 893-906