A Parallel Implementation of Gillespie's Direct Method

Gillespie’s Direct Method Algorithm (1977), is a well-known exact stochastic algorithm for simulating coupled reactions that requires the use of random numbers to calculate which reaction occurs next and when it occurs. However this algorithm is serial in design. For complex chemical systems, this will involve computationally intensive requirements with long simulation runs. This paper looks at decreasing execution times by attempting to parallelize this algorithm through splitting the computational domain into smaller units which will result in smaller computations and thus faster executions.