DEFINISI FINITE STATE OTOMATA UPDATE

The clock ticks, the cells update their statessimultaneously. Steps, the system evolves accordingto universal laws. The discrete space is an array of identicalĬells, each representing alocal state. The theme of this paper is parallelĪ cellular automaton is a discrete model of a system that varies This is one of several papers that explore the benefits ofĭeveloping modelprograms for computational science (Brinch Hansenġ990, 1991a, 1991b,1992a). The performance of the parallel program is analyzed andĪ Computing Surface configured as a matrix of transputers with The generic program is then adapted forįorest fire and numerical solution of Laplaces equation forįlow. We develop a generic program for parallel execution of cellularĪ multicomputer.

Parallel Cellular Automata: A ModelProgram for Computational Copyright c 1993, John Wiley & Sons, Ltd. Concurrency-Practice and Experience 5, 5 (August 1993), 425–448. Brinch Hansen, Parallel Cellular Automata: A model program for computational science. Another well known au- tomaton simulates the life cycles of sharks and ﬁsh on the imaginary planet * P. John Conway’s game of Life is undoubtedly the most widely known cellular au- tomaton (Gardner 1970, 1971 Berlekamp 1982). In 1950 John von Neuman and Stan Ulam introduced cellular automata to study self-reproducing systems (von Neumann 1966 Ulam 1986). The next state of a cell depends only on the current state of the cell and its nearest neighbors. Every time the clock ticks, the cells update their states simultaneously. As time advances in discrete steps, the system evolves according to universal laws. The discrete space is an array of identical cells, each representing a local state. A cellular automaton is a discrete model of a system that varies in space and time.

The theme of this paper is parallel cellular automata. 1 Introduction This is one of several papers that explore the beneﬁts of developing model programs for computational science (Brinch Hansen 1990, 1991a, 1991b, 1992a). The performance of the parallel program is analyzed and measured on a Computing Surface conﬁgured as a matrix of transputers with distributed memory. The generic program is then adapted for simulation of a forest ﬁre and numerical solution of Laplace’s equation for stationary heat ﬂow. Parallel Cellular Automata: A Model Program for Computational Science * (1993) We develop a generic program for parallel execution of cellular automata on a multicomputer.

Definisi finite state otomata