Reactionadiffusion model Monte Carlo simulations on the GPU

We created an efficient algorithm suitable for graphics processing units (GPUs) to perform Monte Carlo simulations on a subset of reactionadiffusion models. The set of reactionadiffusion models that the algorithm is applied to represents a seemingly simplistic set of problems on a one-dimensional la...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computational physics 2013-05, Vol.241, p.95-103
1. Verfasser: Schram, R D
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We created an efficient algorithm suitable for graphics processing units (GPUs) to perform Monte Carlo simulations on a subset of reactionadiffusion models. The set of reactionadiffusion models that the algorithm is applied to represents a seemingly simplistic set of problems on a one-dimensional lattice, where each site contains either a particle or is empty. However, these systems exhibit non-equilibrium phase transitions, with very large finite-time corrections, which mandates a fast algorithm to simulate them. The algorithm presented here uses techniques that are specific to GPU programming, and combines these with multispin coding to create one of the fastest algorithms for reactionadiffusion models. As an example, the algorithm is applied to the pair contact process with diffusion (PCPD). Compared to a simple algorithm on the CPU, our GPU algorithm is approximately 4000 times faster. The GPU algorithm is roughly 55 times faster than an optimized version for the CPU.
ISSN:0021-9991
DOI:10.1016/j.jcp.2013.01.041