ACM Home Page
Please provide us with feedback. Feedback
A compiled accelerator for biological cell signaling simulations
Full text PdfPdf (191 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays table of contents
Monterey, California, USA
SESSION: Applications II table of contents
Pages: 233 - 241  
Year of Publication: 2004
ISBN:1-58113-829-6
Authors
John F. Keane  University of Washington, Seattle, WA
Christopher Bradley  University of Washington, Seattle, WA
Carl Ebeling  University of Washington, Seattle, WA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 43,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/968280.968313
What is a DOI?

ABSTRACT

The simulation of large systems of biochemical reactions is a key part of research into molecular signaling and information processing in biological cells. However, it can be impractical because many relevant reactions are modeled as stochastic, discrete event processes, and the complexity of the computing task scales with the number of discrete events in a simulation. Traditionally, such simulations are computed on general purpose CPUs, and sometimes in networks of such processors. We show that an alternative algorithm to the conventional approaches based on the Gillespie algorithm reveals a fine-grained parallel structure that is amenable to realization in FPGA hardware. A method is shown for compiling biochemical reaction systems into corresponding Verilog descriptions of simulators that employ this alternative algorithm. We describe a preliminary implementation of such a compiled accelerator that demonstrates the performance of this approach, achieving an initial performance that is 20 times faster than a competing general purpose CPU.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bertsekas, D. P. and Tsitsiklis, J. N., Introduction to probability, Belmont, Mass., Athena Scientific, 2002.
 
2
 
3
Bumble, M. and Coraor, L., "Implementing parallelism in random discrete event-driven simulation", in Lecture Notes in Computer Science 1388, Parallel and Distributed Processing, Springer, 1998, 418--427.
 
4
Endy, D. and Brent, R., "Modelling cellular behaviour", Nature, vol. 409 Suppl., Jan 18, 2001, 391--5.
 
5
Marsaglia, G., "DIEHARD: A Battery of Tests of Randomness", 1996.
 
6
Schwehm, M., Brinkschulte, U., Grosspietsch, K. E., Hochberger, C., and Mayr, E. W., "Parallel Stochastic Simulation of Whole-Cell Models", in Proceedings of International Conference on Architecture of Computing Systems. ARCS 2002. Trends in Network and Pervasive Computing. Workshop Proceedings, 2002, 223--31.
 
7
Steinfeld, J. I., Francisco, J. S., and Hase, W. L., Chemical Kinetics and Dynamics, 2nd ed., Upper Saddle River, N.J., Prentice Hall, 1999.
 
8
Walker, J., "ENT, A Pseudorandom Number Sequence Test Program", 1998.
 
9
Yamamoto, O., Shibata, K., Kurosawa, H., and Amano, H., "A reconfigurable Markov chain simulator for analysis of parallel systems", in Proceedings of Second Annual IEEE International Conference on Innovative Systems in Silicon, 1997, 107--116.
 
10

CITED BY  9

Collaborative Colleagues:
John F. Keane: colleagues
Christopher Bradley: colleagues
Carl Ebeling: colleagues