Accelerating the Gillespie t-Leaping Method Using Graphics Processing Units
نویسندگان
چکیده
The Gillespie t-Leaping Method is an approximate algorithm that is faster than the exact Direct Method (DM) due to the progression of the simulation with larger time steps. However, the procedure to compute the time leap t is quite expensive. In this paper, we explore the acceleration of the t-Leaping Method using Graphics Processing Unit (GPUs) for ultra-large networks (w0:5e reaction channels). We have developed data structures and algorithms that take advantage of the unique hardware architecture and available libraries. Our results show that we obtain a performance gain of over 60x when compared with the best conventional implementations. Citation: Komarov I, D’Souza RM, Tapia J-J (2012) Accelerating the Gillespie t-Leaping Method Using Graphics Processing Units. PLoS ONE 7(6): e37370. doi:10.1371/journal.pone.0037370 Editor: Jörg Langowski, German Cancer Research Center, Germany Received November 29, 2011; Accepted April 19, 2012; Published June 8, 2012 Copyright: 2012 Komarov et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Funding: This work was funded by the grants CNS 0968519 and CCF 1013278 from the National Science Foundation (NSF). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Competing Interests: The authors have declared that no competing interests exist. * E-mail: [email protected]
منابع مشابه
Accelerating the Gillespie τ-Leaping Method Using Graphics Processing Units
The Gillespie τ-Leaping Method is an approximate algorithm that is faster than the exact Direct Method (DM) due to the progression of the simulation with larger time steps. However, the procedure to compute the time leap τ is quite expensive. In this paper, we explore the acceleration of the τ-Leaping Method using Graphics Processing Unit (GPUs) for ultra-large networks (>0.5e(6) reaction chann...
متن کاملThe Adaptive Explicit-Implicit Tau-Leaping Method with Automatic Tau Selection
The existing tau-selection strategy, which was designed for explicit tau-leaping, is here modified to apply to implicit tau-leaping, allowing for longer steps when the system is stiff. Further, an adaptive strategy is proposed that identifies stiffness and automatically chooses between the explicit and the (new) implicit tau-selection methods to achieve better efficiency. Numerical testing demo...
متن کاملStiffness in stochastic chemically reacting systems: The implicit tau-leaping method
We show how stiffness manifests itself in the simulation of chemical reactions at both the continuous-deterministic level and the discrete-stochastic level. Existing discrete stochastic simulation methods, such as the stochastic simulation algorithm and the ~explicit! tau-leaping method, are both exceedingly slow for such systems. We propose an implicit tau-leaping method that can take much lar...
متن کاملParallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform
There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...
متن کاملAccelerating the Gillespie Exact Stochastic Simulation Algorithm Using Hybrid Parallel Execution on Graphics Processing Units
The Gillespie Stochastic Simulation Algorithm (GSSA) and its variants are cornerstone techniques to simulate reaction kinetics in situations where the concentration of the reactant is too low to allow deterministic techniques such as differential equations. The inherent limitations of the GSSA include the time required for executing a single run and the need for multiple runs for parameter swee...
متن کامل