Massively Parallel Logic Simulation with GPUs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Adapting rule-based model descriptions for simulating in continuous and hybrid space
Proceedings of the 9th International Conference on Computational Methods in Systems Biology
Comparing Parallel Simulation of Social Agents Using Cilk and OpenCL
DS-RT '11 Proceedings of the 2011 IEEE/ACM 15th International Symposium on Distributed Simulation and Real Time Applications
Smoldyn on Graphics Processing Units: Massively Parallel Brownian Dynamics Simulations
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Tutorial on building M&S software based on reuse
Proceedings of the Winter Simulation Conference
Explicit routing schemes for implementation of cellular automata on processor arrays
Natural Computing: an international journal
| Hi-index | 0.00 |
Cellular automata are a well-known modeling formalismexploited in a wide range of application areas. In many ofthose, the complexity of models hampers a thorough analysis ofthe system under study. Therefore, efficient simulation algorithmsare required. We present here a comparison of seven different simulation algorithms for cellular automata: the classical “full” simulator, the classical “discrete event” simulator, a threaded (multi core) variant of each of these, an adaptable threadedvariant, and a GPU based algorithm with and without readbackof calculated states. The comparison is done based on the M&Sframework JAMES II by using a set of well-known models.