An efficient mulithreading algorithm for the simulation of global illumination
- Autores: Barladian B.K.1, Shapiro L.Z.1, Denisov E.Y.1, Voloboy A.G.1
-
Afiliações:
- Keldysh Institute of Applied Mathematics
- Edição: Volume 43, Nº 4 (2017)
- Páginas: 217-223
- Seção: Article
- URL: https://journals.rcsi.science/0361-7688/article/view/176514
- DOI: https://doi.org/10.1134/S0361768817040028
- ID: 176514
Citar
Resumo
The calculation of global illumination taking into account not only the direct light but also all its possible reflections is an important part of the synthesis of realistic images. The simulation of global illumination requires a lot of computational resources. The performance of modern computers directly depends on the number of cores, which allow one to use tens of parallel computation threads. The paper is devoted to the effective use of multicore computers for simulating the global illumination. The computation results are represented in a uniform illumination map. The proposed algorithm dynamically creates additional threads for the critical branches of the computation process or processing of results. As a result, the uniform load of computation threads as achieved, and the physical and virtual cores are fully loaded.
Sobre autores
B. Barladian
Keldysh Institute of Applied Mathematics
Autor responsável pela correspondência
Email: bbarladian@gmail.com
Rússia, Moscow, 125047
L. Shapiro
Keldysh Institute of Applied Mathematics
Email: bbarladian@gmail.com
Rússia, Moscow, 125047
E. Denisov
Keldysh Institute of Applied Mathematics
Email: bbarladian@gmail.com
Rússia, Moscow, 125047
A. Voloboy
Keldysh Institute of Applied Mathematics
Email: bbarladian@gmail.com
Rússia, Moscow, 125047
Arquivos suplementares
