Asynchronous automata versus asynchronous cellular automata
Theoretical Computer Science
Multidimensional &sgr;-automata, &pgr;-polynomials and generalised S-matrices
Theoretical Computer Science
Implementation of Visuel MPI Parallel Program Performance Analysis Tool for Cluster Environments
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate Online
Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate Online
The university of Florida sparse matrix collection
ACM Transactions on Mathematical Software (TOMS)
A parallel cellular automata with label priors for interactive brain tumor segmentation
CBMS '10 Proceedings of the 2010 IEEE 23rd International Symposium on Computer-Based Medical Systems
How to Use Google App Engine for Free Computing
IEEE Internet Computing
Hi-index | 0.00 |
Cellular automata can be applied to solve several problems in a variety of areas, such as biology, chemistry, medicine, physics, astronomy, economics, and urban planning. The automata are defined by simple rules that give rise to behavior of great complexity running on very large matrices. 2D applications may require more than 10^6x10^6 matrix cells, which are usually beyond the computational capacity of local clusters of computers. This paper presents a solution for traditional cellular automata simulations. We propose a scalable software framework, based on cloud computing technology, which is capable of dealing with very large matrices. The use of the framework facilitates the instrumentation of simulation experiments by non-computer experts, as it removes the burden related to the configuration of MapReduce jobs, so that researchers need only be concerned with their simulation algorithms.