Abstract
Four basic cellular automata (CA) algorithms are implemented on a Beowulf cluster with 8 processors using MPI and C. The CA algorithms are, namely, (1) Game of Life, (2) Greenburg-Hasting, (3) Cyclic Space, and (4) Hodgepodge Machine. Also, the mathematical and computational aspects of 1D and 2D CA are considered.

