Real Time Global Illumination Solutions to the Radiosity Algorithm using Hybrid CPU/GPU Nodes
dc.contributor.author | Adenikinju, Oluwapelumi | |
dc.contributor.author | Gilyard, Julian | |
dc.contributor.author | Massey, Joshua | |
dc.contributor.author | Stitt, Thomas | |
dc.contributor.author | Graf, Jonathan | |
dc.contributor.author | Huang, Xuan | |
dc.contributor.author | Khuvis, Samuel | |
dc.contributor.author | Gobbert, Matthias K. | |
dc.contributor.author | Wang, Yu | |
dc.contributor.author | Olano, Marc | |
dc.date.accessioned | 2018-10-01T13:47:56Z | |
dc.date.available | 2018-10-01T13:47:56Z | |
dc.date.issued | 2014 | |
dc.description.abstract | We investigate high performance solutions to the global illumination problem in computer graphics. An existing CPU serial implementation using the radiosity method is given as the performance baseline where a scene and corresponding form-factor coefficients are provided. The initial computational radiosity solver uses the classical Jacobi method as an iterative approach to solving the radiosity linear system. We add the option of using the modern BiCG-STAB method with the aim of reduced runtime through a reduction in iteration count with respect to Jacobi for complex problems. It is found that for the test scenes used, the convergence complexity was not great enough to take advantage of mathematical reformulation through BiCG-STAB. Single-node parallelization techniques are implemented through OpenMP-based threading, GPU- overloading, and hybrid threading/GPU overloading and it is seen that in general OpenMP is optimal by requiring no expense. Finally, we investigate the non-standard-array storage style of the system to determine whether storage through arrays of structures or structures of arrays results in better performance. We find that the usage of arrays of structures in conjunction with OpenMP results in the best performance except for small scene sizes where CUDA shows the minimal runtime. | en_US |
dc.description.sponsorship | These results were obtained as part of the REU Site: Interdisciplinary Program in High Performance Computing (www.umbc.edu/hpcreu) in the Department of Mathematics and Statistics at the University of Maryland, Baltimore County (UMBC) in Summer 2014. This program is funded jointly by the National Science Foundation and the National Security Agency (NSF grant no. DMS{1156976), with additional support from UMBC, the Department of Mathematics and Statistics, the Center for Interdisciplinary Research and Consulting (CIRC), and the UMBC High Performance Computing Facility (HPCF). HPCF is supported by the U.S. National Science Foundation through the MRI program (grant nos. CNS{0821258 and CNS{1228778) and the SCREMS program (grant no. DMS{0821311), with additional substantial support from UMBC. Co-authors Oluwapelumi Adenikinju and Joshua Massey were supported, in part, by the UMBC National Security Agency (NSA) Scholars Program through a contract with the NSA. Co-authors Jonathan Graf, Xuan Huang, Samuel Khuvis, and Yu Wang were supported during Summer 2014 by UMBC. | en_US |
dc.description.uri | https://userpages.umbc.edu/~gobbert/papers/REU2014Team5.pdf | en_US |
dc.format.extent | 18 pages | en_US |
dc.genre | technical report | en_US |
dc.identifier | doi:10.13016/M2H41JR0J | |
dc.identifier.uri | http://hdl.handle.net/11603/11407 | |
dc.language.iso | en_US | en_US |
dc.relation.isAvailableAt | The University of Maryland, Baltimore County (UMBC) | |
dc.relation.ispartof | UMBC Mathematics Department Collection | |
dc.relation.ispartofseries | HPCF Technical Report;HPCF-2014-15 | |
dc.relation.ispartofseries | UMBC Computer Science and Electrical Engineering Department | |
dc.relation.ispartofseries | UMBC Faculty Collection | |
dc.relation.ispartofseries | UMBC Student Collection | |
dc.rights | This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author. | |
dc.subject | OpenMP | en_US |
dc.subject | GPU- overloading | en_US |
dc.subject | BiCG-STAB method | en_US |
dc.subject | CUDA | en_US |
dc.subject | UMBC High Performance Computing Facility (HPCF) | en_US |
dc.subject | global illumination problem | |
dc.subject | radiosity method | |
dc.subject | Jacobi method | |
dc.subject | OpenMP-based threading | |
dc.title | Real Time Global Illumination Solutions to the Radiosity Algorithm using Hybrid CPU/GPU Nodes | en_US |
dc.type | Text | en_US |