Hybrid Scheduling for Efficient Ray Tracing of Complex Images
Ray tracing is a powerful technique to generate realistic images of 3D scenes. A drawback is its high demand for processing power. Multiprocessing is one way to meet this demand. However, when the models are very large, special attention must be paid to the way the algorithm is parallelised. Combining demand driven and data parallel techniques provides good opportunities to arrive at an efficient scalable algorithm. Which tasks to process demand driven and which data driven, is decided by the data intensity of the task and the amount of data locality (coherence) that will be present in the task. Rays with the same origin and similar directions, such as primary rays and light rays, exhibit much coherence. These rays are therefore traced in demand driven fashion, a bundle at a time. Non-coherent rays are traced data parallel. By combining demand driven and data driven tasks, a good load balance may be achieved, while at the same time spreading the communication evenly across the network. This leads to a scalable and efficient parallel implementation of the ray tracing algorithm.
KeywordsLoad Balance Data Parallel Object Database Good Load Balance Slave Processor
Unable to display preview. Download preview PDF.
- F. C. Crow, G. Demos, J. Hardy, J. McLaugglin, K. Sims, 3d image synthesis on the connection machine, in Proceedings Parallel Processing for Computer Vision and Display, Leeds, (1988).Google Scholar
- L. S. Shen, A Parallel Image Rendering Algorithm and Architecture Based on Ray Tracing and Radiosity Shading, PhD thesis, TUDelft, Delft, (1993).Google Scholar
- F. W. Jansen, A. Chalmers, Realism in real time?, in 4th EG Workshop on Rendering, pp. 1–20, (1993).Google Scholar
- I. D. Scherson, C. Caspary, A self-balanced parallel ray-tracing algorithm, in P. M. Dew, R. A. Earnshaw, T. R. Heywood, eds, Parallel Processing for Computer Vision and Display, Vol. 4, Addison-Wesley Publishing Company, Wokingham, pp. 188–196, (1988).Google Scholar
- J. S. Singh, A. Gupta, M. Levoy, Parallel Visualization Algorithms: Performance and Architectural Implications, IEEE Computer, 277, 45–55, (1994).Google Scholar
- N. Greene, Detecting intersection of a rectengualr solid and a convex polyhedron, in P. S. Heckbert, ed., Graphics Gems IV, AP Professional, Cambridge, MA, chapter 1.7, pp. 74–82, (1994).Google Scholar
- G. J. Ward, The radiance lighting simulation and rendering system, ACM Computer Graphics pp. 459–472. SIGGRAPH ‘84 Proceedings, (1994).Google Scholar
- C. E. Kolb, Rayshade User’s Guide and Reference Manual. Included in Rayshade distribution, which is available by ftp from princeton.edu:pub/Graphics/rayshade.4.0, (1992).Google Scholar
- A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, V. Sunderam, PVM 3 Users Guide and Reference Manual, Oak Ridge National Laboratory, Oak Ridge, Tennessee. Included with the PVM 3 distribution, (1993).Google Scholar