IEEE Computer Graphics and Applications · 1994 · 48 citations · 18 references
ComputingComputer EngineeringComputer ScienceMessage PassingParallel AlgorithmsParallel ComputingDistributed ComputingDistributed Memory ParallelismDistributed Memory SystemsParallel ArchitecturesParallel Computing SystemsRay TracingData DistributionData Distribution AnalysisData Distribution StrategiesDistributed MemoryDistributed Memory AlgorithmsLoad Balancing ModelsParallel Computing ArchitecturesShared-memory Algorithms
We first briefly describe the methodology of programming ray-tracing algorithms on distributed-memory parallel computers, or DMPCs, and review previous efforts to overcome the problems of data distribution and load balancing. Then we present two algorithms designed for DMPCs and implemented on an Intel iPSC/2. We also compare the results of our experiments with them. The first algorithm, a data-oriented parallel implementation based on message passing, demonstrates how complex designing a parallel ray-tracing algorithm can be. The second algorithm shows how we can eliminate some complexity using a control-oriented parallel approach and a shared virtual memory.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
18
On visible surface generation by a priori tree structures
Henry Fuchs, Zvi M. Kedem, Bruce Naylor · 1980 · 698 citations · Full text
The pixel machine: a parallel image computer
Michael Potmesil, Eric M. Hoffert · 1989 · 101 citations · Full text