Distributed Processing and Parallel Simulation of Cellular Automaton Models using a Cell Packing Scheme


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 4, pp. 883-891, Apr. 1998
10.3745/KIPSTE.1998.5.4.883,   PDF Download:

Abstract

This paper proposes a scheme to exploit SIMD parallelism in the simulation of Cellular Automata models. The basic idea is to increase the utilization of an ALU in the underlying computer and to reduce simulation time by exploiting the parallelism. Thus, several cells are packed into a computer word and transit their state together. To show the performance of the proposed simulation scheme, two Cellular Automata models are simulated under three distinct hardware environments. The results show considerably high simulation speed-up for every case. Especially, the simulation speedup with the proposed simulation scheme reaches nearly 20 times in the best case.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. Y. Rak, "Distributed Processing and Parallel Simulation of Cellular Automaton Models using a Cell Packing Scheme," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 4, pp. 883-891, 1998. DOI: 10.3745/KIPSTE.1998.5.4.883.

[ACM Style]
Seong Yeong Rak. 1998. Distributed Processing and Parallel Simulation of Cellular Automaton Models using a Cell Packing Scheme. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 4, (1998), 883-891. DOI: 10.3745/KIPSTE.1998.5.4.883.