A Flexible Algorithm for Multiprocessor Ray Tracing

Abstract

Ray tracing programs are widely used to generate photo-realistic images, but the high computation time may discourage their implementation on single-processor machines; moreover, cost reduction of multi-processor general purpose architectures makes parallel rendering an attractive field of research. We propose a new algorithm which addresses the main issues of a parallel implementation of ray tracing on a message-passing-based machine. We adopt efficient strategies for dynamic workload distribution among processors, task synchronization and communication delay reduction. The resulting implementation is highly flexible, since any number of processors can be employed without introducing synchronization problems. We show an implementation of our algorithm on an nCUBE 2 supercomputer which is a general purpose parallel architecture with distributed memory. A theoretical evaluation of our algorithm allows us to identify a decreasing function for rendering times; the considered examples confirm the theoretical expectations showing that the efficiency of our system may reach up to the 91% of the value achievable by dividing the sequential rendering time by the number of processors employed.

Rpu

“…The key goal has been to optimally exploit the parallelism of the hardware architecture in order to achieve high floating point performance [Muuss 1995;Parker et al 1999;Nebel 1997;Andrea Sanna and Rossi 1998;Badouel and Priol 1990;Keates and Hubbold 1995].…”

A PVM-Based Parallel Implementation of the REYES Image Rendering Architecture

“…Moreover, the computation of a pixel is independent of the others, therefore, a straightforward parallelization can be obtained [3][4][5][6][7][8][9][10][11][12]. Of particular interest are the distributed rendering algorithms tailored for PC/workstation clusters.…”