MIMD分散並列計算機に適したレイトレーシングの並列化アルゴリズムの検討

抄録

In the field of visualization and CG (Computer Graphics), it is necessary to propose new methods to present objects precisely and to display images in real time. However, these methods need a great deal of computing time and memory. Recently, many methods, using a massive parallel computer, have been reported to satisfy these conditions. The purpose of our research is to develop practical visualization algorithms for massive parallel computers. In this paper, a parallel ray tracing algorithm is proposed, because the ray tracing algorithm has a great deal of parallelism and is able to take advantage of the high performance of massive parallel computers. The ray tracing algorithm has some parallel approaches, i.e. pixels parallel, objects parallel, rays parallel and so on. We propose a hybrid parallel ray tracing algorithm to include these parallel approaches and allowing experiments to compare processing time between each parallel approach. In conclusion, we point out problems with hybrid algorithms on massive parallel computers.