The Community for Technology Leaders
Green Image
Issue No. 02 - February (2012 vol. 23)
ISSN: 1045-9219
pp: 280-287
Philip K. Maini , University of Oxford, Oxford
Mike Giles , University of Oxford, Oxford
Radek Erban , University of Oxford, Oxford
Guido Klingbeil , University of Oxford, Oxford
ABSTRACT
We explore two different threading approaches on a graphics processing unit (GPU) exploiting two different characteristics of the current GPU architecture. The fat thread approach tries to minimize data access time by relying on shared memory and registers potentially sacrificing parallelism. The thin thread approach maximizes parallelism and tries to hide access latencies. We apply these two approaches to the parallel stochastic simulation of chemical reaction systems using the stochastic simulation algorithm (SSA) by Gillespie [14]. In these cases, the proposed thin thread approach shows comparable performance while eliminating the limitation of the reaction system's size.
INDEX TERMS
Parallel processing, compute unified device architecture (CUDA), graphics processing unit (GPU).
CITATION
Philip K. Maini, Mike Giles, Radek Erban, Guido Klingbeil, "Fat versus Thin Threading Approach on GPUs: Application to Stochastic Simulation of Chemical Reactions", IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 280-287, February 2012, doi:10.1109/TPDS.2011.157
87 ms
(Ver )