z-logo
open-access-imgOpen Access
Monte Carlo Simulation of Photon Migration in 3D Turbid Media Accelerated by Graphics Processing Units
Author(s) -
Qianqian Fang,
David A. Boas
Publication year - 2009
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.17.020178
Subject(s) - monte carlo method , computer science , cuda , computational science , graphics processing unit , massively parallel , graphics , photon , parallel computing , random number generation , optics , algorithm , computer graphics (images) , physics , statistics , mathematics
We report a parallel Monte Carlo algorithm accelerated by graphics processing units (GPU) for modeling time-resolved photon migration in arbitrary 3D turbid media. By taking advantage of the massively parallel threads and low-memory latency, this algorithm allows many photons to be simulated simultaneously in a GPU. To further improve the computational efficiency, we explored two parallel random number generators (RNG), including a floating-point-only RNG based on a chaotic lattice. An efficient scheme for boundary reflection was implemented, along with the functions for time-resolved imaging. For a homogeneous semi-infinite medium, good agreement was observed between the simulation output and the analytical solution from the diffusion theory. The code was implemented with CUDA programming language, and benchmarked under various parameters, such as thread number, selection of RNG and memory access pattern. With a low-cost graphics card, this algorithm has demonstrated an acceleration ratio above 300 when using 1792 parallel threads over conventional CPU computation. The acceleration ratio drops to 75 when using atomic operations. These results render the GPU-based Monte Carlo simulation a practical solution for data analysis in a wide range of diffuse optical imaging applications, such as human brain or small-animal imaging.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here