The Implementation of Ray Tracing Algorithm with OpenMP Parallelization  

作　　者：Noor Alnasser Raghad Alabssi Batool Faran Latifah Alessa Naya Nagy Noor Alnasser;Raghad Alabssi;Batool Faran;Latifah Alessa;Naya Nagy(College of Computer Science and IT, Imam Abdulrahman Bin Faisal University, Dammam, Kingdom of Saudi Arabia)

机构地区：[1]College of Computer Science and IT, Imam Abdulrahman Bin Faisal University, Dammam, Kingdom of Saudi Arabia

出　　处：《Journal of Computer and Communications》2024年第1期120-130,共11页电脑和通信（英文）

摘　　要：Ray tracing is a computer graphics method that renders images realistically. As the name suggests, this technique primarily traces the path of light rays interacting with objects in a scene [1], permitting the calculation of lighting and reflecting impact [2]. As ray tracing is a time-consuming process, the need for parallelization to solve this problem arises. One downside of this solution is the existence of race conditions. In this work, we explore and experiment with a different, well-known solution for this race condition. Starting with the introduction and the background section, a brief overview of the topic is followed by a detailed part of how the race conditions may occur in the case of the ray tracing algorithm. Continuing with the methods and results section, we have used OpenMP to parallelize the Ray tracing algorithm with the different compiler directives critical, atomic, and first-private. Hence, it concluded that both critical and atomic are not efficient solutions to produce a good-quality picture, but first-private succeeded in producing a high-quality picture.Ray tracing is a computer graphics method that renders images realistically. As the name suggests, this technique primarily traces the path of light rays interacting with objects in a scene [1], permitting the calculation of lighting and reflecting impact [2]. As ray tracing is a time-consuming process, the need for parallelization to solve this problem arises. One downside of this solution is the existence of race conditions. In this work, we explore and experiment with a different, well-known solution for this race condition. Starting with the introduction and the background section, a brief overview of the topic is followed by a detailed part of how the race conditions may occur in the case of the ray tracing algorithm. Continuing with the methods and results section, we have used OpenMP to parallelize the Ray tracing algorithm with the different compiler directives critical, atomic, and first-private. Hence, it concluded that both critical and atomic are not efficient solutions to produce a good-quality picture, but first-private succeeded in producing a high-quality picture.

关 键 词：PARALLELIZATION Ray Tracing Parallel Computer Architecture OPENMP 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]