Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1145/968280.968313 | FPGA |
Keywords | Field | DocType |
general purpose cpus,biological cell,discrete event,biochemical reaction system,gillespie algorithm,general purpose,discrete event process,fpga hardware,initial performance,alternative algorithm,biochemical reaction,reconfigurable hardware,biology,cell,simulation,cell signaling,reactions,information processing | Information processing,General purpose,Computer science,Parallel computing,Field-programmable gate array,Real-time computing,Biochemical reactions,Gillespie algorithm,Verilog,Biological cell,Reconfigurable computing | Conference |
ISBN | Citations | PageRank |
1-58113-829-6 | 18 | 1.61 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John F. Keane | 1 | 24 | 3.83 |
| Christopher Bradley | 2 | 18 | 2.62 |
| Carl Ebeling | 3 | 1405 | 185.32 |