Multiprocessor Ray Tracing
Multiprocessor Ray Tracing
复制标题
多处理器光线追踪
DOI：
10.1111/j.1467-8659.1986.tb00263.x
复制
发表时间：
1986
影响因子：
2.5
通讯作者：
R. Vatti
中科院分区：
文献类型：
--
作者：
J. Cleary;B. Wyvill;G. Birtwistle;R. Vatti
描述了用于光线追踪的多处理器算法。针对仅在邻近处理器之间进行本地通信的立方体和方形处理器阵列来分析该算法的性能。导出了系统加速比与处理器数量的关系的理论表达式。这些分析结果得到了对许多具有多边形表面的简单场景的光线追踪模拟的支持。研究发现，方形处理器网络通常比立方体网络表现更好。对使用当前（1985）微处理器技术构建这样的系统进行了一些评论。
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.