Accelerating Wright–Fisher Forward Simulations on the Graphics Processing Unit. Issue 9 (1st September 2017)

• Record Type: Journal Article
• Authors: Lawrie, David S
• Is Part Of: G3. Volume 7:Issue 9(2017)
• Page Start: 3229
• Page End: 3236
• Publication Date: 2017-09-01
• Subjects: GPU -- Wright–Fisher model -- simulation -- population genetics; Genetics -- Research -- Periodicals; Genomics -- Periodicals; Genetics; Genomics; Genes; Genetics -- Research; Genomics; Electronic journals; Periodical; Periodicals; Fulltext; Internet Resources; Periodicals; 572.8
• DOI: 10.1534/g3.117.300103
• Languages: English
• ISSNs: 2160-1836

Abstract

Abstract: Forward Wright–Fisher simulations are powerful in their ability to model complex demography and selection scenarios, but suffer from slow execution on the Central Processor Unit (CPU), thus limiting their usefulness. However, the single-locus Wright–Fisher forward algorithm is exceedingly parallelizable, with many steps that are so-called "embarrassingly parallel, " consisting of a vast number of individual computations that are all independent of each other and thus capable of being performed concurrently. The rise of modern Graphics Processing Units (GPUs) and programming languages designed to leverage the inherent parallel nature of these processors have allowed researchers to dramatically speed up many programs that have such high arithmetic intensity and intrinsic concurrency. The presented GPU Optimized Wright–Fisher simulation, or "GO Fish" for short, can be used to simulate arbitrary selection and demographic scenarios while running over 250-fold faster than its serial counterpart on the CPU. Even modest GPU hardware can achieve an impressive speedup of over two orders of magnitude. With simulations so accelerated, one can not only do quick parametric bootstrapping of previously estimated parameters, but also use simulated results to calculate the likelihoods and summary statistics of demographic and selection models against real polymorphism data, all without restricting the demographic and selection scenarios that can be modeled or requiring approximations to the single-locus forward algorithm for efficiency. Further, as many of the parallel programming techniques used in this simulation can be applied to other computationally intensive algorithms important in population genetics, GO Fish serves as an exciting template for future research into accelerating computation in evolution. GO Fish is part of the Parallel PopGen Package available at: http://dl42.github.io/ParallelPopGen/.