Poster Type: Research Posters
Author: Alfia Parvez (University of Illinois Urbana-Champaign), Zaida (Zan) Luthey-Schulten (University of Illinois Urbana-Champaign)
Abstract: Exact stochastic simulation of biochemical networks requires large trajectory ensembles for increasingly large reaction models, creating two main bottlenecks: dense model storage can exceed device memory, while serial reaction selection costs O(M) per step.
We built an exact GPU Gillespie solver in Lattice Microbes software that stores stoichiometry and the reaction dependency graph in a compressed sparse row format and selects reactions using a warp-cooperative 32-ary propensity tree in O(log₃₂M). Our major contribution combines sparse storage with warp-cooperative logarithmic selection for exact GPU SSA. The solver is implemented and validated against StochKit2; release in Lattice Microbes v3.0 is planned.
On an NVIDIA B200 across five models with 18–58,276 reactions, memory use decreases by ~800×, enabling up to 100K trajectories where other tools run out of memory. This poster presents the algorithm, sparse data layout, scaling, and comparative performance, including up to ~20× higher throughput where competing tools still fit.
Best Poster Finalist (BP): no
Poster: PDF
Poster Summary: PDF