Parallel Implementation of a Cellular Automaton Model for the Simulation of Laser Dynamics

Abstract

Abstract.A parallel implementation for distributed-memory MIMD systems of a 2D discrete model of laser dynamics based on cellular automata is presented. The model has been implemented on a PC cluster using a message passing library. A good performance has been obtained, allowing us to run realistic simulations of laser systems in clusters of workstations, which could not be afforded on an individual machine due to the extensive runtime and memory size needed.

Laser Dynamics Modelling and Simulation: An Application of Dynamic Load Balancing of Parallel Cellular Automata

“…In this section, we describe the parallel implementation of the previous CA model and study its performance and scalability running on a small computer cluster (interested readers can refer to [9], [10], [11] and [12] for a larger description of results obtained). We begin by reviewing previous approaches to parallel implementations of CA models.…”

Developing Efficient Discrete Simulations on Multicore and GPU Architectures

“…In order to reduce the runtime of laser simulations with this model by taking advantage of its parallel nature, a parallel implementation of it for computer clusters (distributed-memory parallel computers), using the message-passing programming paradigm, was introduced in [20,21]. It showed a good performance on dedicated computer clusters [22] and also on heterogeneous non-dedicated clusters with a dynamic load balancing mechanism [23].…”

The Implementation Of Cellular Automata With Non-identical Rule On Serial Base

“…In this case, it has only one processor cell to compute its new value, which provides the processor to other cells so that these cells can use the processor and calculate their new values. Since a single cell can use the processor in this method at any moment, the overall speed of calculation is much slower than the parallel methods [5]. If the speed of the processor responsible for performing calculation in serial implementations can be raised, a new value for each cell can be calculated faster, and the overall rate of cellular automaton rises and improves [6].…”