Robert Francis Boothe
EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-89-534
September 1989
http://www2.eecs.berkeley.edu/Pubs/TechRpts/1989/CSD-89-534.pdf
Ray-tracing is often suggested as a problem which is well suited for execution on multiprocessors. It is characterized by having abundant parallelism, a very small sequential part, and aggravatingly long run-times. For simple will behaved scenes, linear speedup is easily achievable. However for realistic scenes which are typically both complex and non-uniformly distributed, parallel ray-tracing is a challenging problem. This thesis evaluates and compares implementations of a sophisticated ray-tracer on both shared memory and distributed memory machines.
BibTeX citation:
@techreport{Boothe:CSD-89-534, Author = {Boothe, Robert Francis}, Title = {Multiprocessor Strategies for Ray-Tracing}, Institution = {EECS Department, University of California, Berkeley}, Year = {1989}, Month = {Sep}, URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1989/5899.html}, Number = {UCB/CSD-89-534}, Abstract = {Ray-tracing is often suggested as a problem which is well suited for execution on multiprocessors. It is characterized by having abundant parallelism, a very small sequential part, and aggravatingly long run-times. For simple will behaved scenes, linear speedup is easily achievable. However for realistic scenes which are typically both complex and non-uniformly distributed, parallel ray-tracing is a challenging problem. This thesis evaluates and compares implementations of a sophisticated ray-tracer on both shared memory and distributed memory machines.} }
EndNote citation:
%0 Report %A Boothe, Robert Francis %T Multiprocessor Strategies for Ray-Tracing %I EECS Department, University of California, Berkeley %D 1989 %@ UCB/CSD-89-534 %U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1989/5899.html %F Boothe:CSD-89-534