Julia High Performance - Second Edition

Conway's Game of Life

We saw that DArray objects are stored across multiple nodes, and operating on the local parts in each node is most efficient. However, since each worker node can also talk to all other worker nodes, DArray objects are also good for tiled operations, where each node operates on its own data and limited amounts of data from its immediate neighbors. Hence, algorithms such as convolutions or Conway's Game of Life are good candidates. 

As an example, let's show you the code for Conway's Game of Life implemented using distributed arrays:

1. Write a life_step function that creates a new DArray, representing a new generation, from an existing DArray, representing the old generation. The code is split on nodes using the DArray ...