A data parallel algorithm for ray tracing of heterogeneous databases
Peter Schröder, Steven M. Drucker · 1992
We describe a new data parallel algorithm for raytracing. Load balancing is achieved through the use of processor allocation, which continually remaps available resources. In this manner heterogeneous data bases are handled without the usual problems of low resource usage. The proposed approach adapts well to both extremes: a small number of rays and a large database; a large number of rays and a small database. The algorithm scales linearly---over a wide range---in the number of rays and available processors. We present an implementation on the Connection Machine CM2 system and provide timings. R'esum'e Cet article pr'esente un nouvel algorithme parall`ele pour le lancer de rayons. L'allocation des processeurs, qui distribue la tache aux resources disponibles, permet de garder une charge bien r'epartie. Ainsi 'evitons nous les probl`emes usuels dus aux ressources de bas niveau tout en manipulant des structures de donn'ees h'et'erog`enes. Notre approche s'applique aussi bien `a un f...