Perfect Load Balancing for Demand-Driven Parallel Ray Tracing

  • Authors:
  • Tomas Plachetka

  • Affiliations:
  • -

  • Venue:
  • Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A demand-driven parallelization of the ray tracing algorithm is presented. Correctness and optimality of a perfect load balancing algorithm for image space subdivision are proved and its exact message complexity is given. An integration of antialiasing into the load balancing algorithm is proposed. A distributed object database allows rendering of complex scenes which cannot be stored in the memory of a single processor. Each processor maintains a permanent subset of the object database as well as a cache for a temporary storage of other objects. A use of object bounding boxes and bounding hierarchy in combination with the LRU (Last Recently Used) caching policy reduces the number of requests for missing data to a necessary minimum. The proposed parallelization is simple and robust. It should be easy to implement with any sequential ray tracer and any message-passing system. Our implementation is based on POV-Ray and PVM.