Premium
Multiprocessor Ray Tracing
Author(s) -
Cleary John G.,
Wyvill Brian M.,
Birtwistle Graham M.,
Vatti Reddy
Publication year - 1986
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.1986.tb00263.x
Subject(s) - multiprocessing , ray tracing (physics) , computer science , tracing , speedup , microprocessor , parallel computing , square (algebra) , function (biology) , simple (philosophy) , algorithm , mathematics , geometry , embedded system , optics , physics , operating system , philosophy , epistemology , evolutionary biology , biology
A multiprocessor algorithm for ray tracing is described. The performance of the algorithm is analysed for a cubic and square array of processors with only local communication between near neighbours. Theoretical expressions for the speedup of the system as a function of the number of processors are derived. These analytic results are supported by simulations of ray tracing on a number of simple scenes with polygonal surfaces. It is found that a square network of processors generally performs better than a cubic network. Some comments are made on the construction of such a system using current (1985) microprocessor technology.