Computer Science Technical Reports
CS at VT

Parallel Load Balancing Strategies for Ensembles of Stochastic Biochemical Simulations

Ahn, Tae-Hyuk and Sandu, Adrian and Watson, Layne T. and Shaffer, Clifford A. and Cao, Yang and Baumann, William T. (2010) Parallel Load Balancing Strategies for Ensembles of Stochastic Biochemical Simulations. Technical Report TR-10-17, Computer Science, Virginia Tech.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
ccmTCBB10.pdf (968041)


The evolution of biochemical systems where some chemical species are present with only a small number of molecules, is strongly influenced by discrete and stochastic effects that cannot be accurately captured by continuous and deterministic models. The budding yeast cell cycle provides an excellent example of the need to account for stochastic effects in biochemical reactions. To obtain statistics of the cell cycle progression, a stochastic simulation algorithm must be run thousands of times with different initial conditions and parameter values. In order to manage the computational expense involved, the large ensemble of runs needs to be executed in parallel. The CPU time for each individual task is unknown before execution, so a simple strategy of assigning an equal number of tasks per processor can lead to considerable work imbalances and loss of parallel efficiency. Moreover, deterministic analysis approaches are ill suited for assessing the effectiveness of load balancing algorithms in this context. Biological models often require stochastic simulation. Since generating an ensemble of simulation results is computationally intensive, it is important to make efficient use of computer resources. This paper presents a new probabilistic framework to analyze the performance of dynamic load balancing algorithms when applied to large ensembles of stochastic biochemical simulations. Two particular load balancing strategies (point-to-point and all-redistribution) are discussed in detail. Simulation results with a stochastic budding yeast cell cycle model confirm the theoretical analysis. While this work is motivated by cell cycle modeling, the proposed analysis framework is general and can be directly applied to any ensemble simulation of biological systems where many tasks are mapped onto each processor, and where the individual compute times vary considerably among tasks.

Item Type:Departmental Technical Report
Keywords:Stochastic simulation algorithm (SSA), parallel computing, load balancing, cell cycle, budding yeast
Subjects:Computer Science > Parallel Computation
ID Code:1137
Deposited By:Administrator, Eprints
Deposited On:08 December 2010