Download Full Text (83.4 MB)
Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.
MapReduce, distributed life simulations, cloud computing, large-scale life models, distributed software simulations, MPI, strip partitioning
Artificial Intelligence and Robotics | Computer Sciences | Numerical Analysis and Scientific Computing | Theory and Algorithms
Radenski, A. Using MapReduce Streaming for Distributed Life Simulation on the Cloud, In Advances in Artificial Life, ECAL 2013, MIT Press, 2013, 284-291.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.
Artificial Intelligence and Robotics Commons, Numerical Analysis and Scientific Computing Commons, Theory and Algorithms Commons
The download link contains the full text of the book. Prof. Radenski's chapter begins on page 284.