A Strategy for Mapping Parallel Ray-Tracing into a Hypercube Multiprocessor System

We present a systematic and efficient strategy for mapping an adaptively/regularly subdivided object space (a set of subspaces) into the nodes of the hypercube. The property of this mapping is that the distance between the neighbouring subspaces on the hypercube is proportional to the difference between the sizes of these subspaces. Especially, if neighbouring subspaces are of equal size, these subspaces are allocated to the neighbouring processors. As a result, we can realize a communication-effective implementation of parallel ray-tracing on the hypercube multiprocessor system. The mapping is derived from the byproduct of octree encoding of an object space.