Hash Life algorithm on 3D excitable medium Application to Integrative Biology
Jonathan Caux, David Hill and Pridi Siregar
The 2010 Summer Computer Simulation Conference (SCSC 10)
Ottawa, Canada, July 11-14, 2010
In this paper, we explore the possibility of using the Hash Life algorithm for the simulation of 3D excitable media. Such media are commonly used to create model of biological behaviors like cardiac myocytes stimulation and are easily modeled with cellular automata. To speed up these automata, hardware or software acceleration can be used. The Hash Life algorithm, which used memoisation to allow significant speed up, is the most efficient on 2D determinist cellular automata [Gosper 1984]. When used in 3D, the combinatorial explosion of the number of configurations of cells can severely impact its performances and restricts its use. We have implemented a 3D Hash Life and tested its execution on excitable medium to determine in which conditions this algorithm could be useful. Results show that Hash Life capacity to compute numerous iterations in advance still enables very good performances when simulating the functioning of an excitable medium.
Conference Manager (V2.56.8 - Rev. 1182)