The diagram shows cyclic decomposition, where each process is dealt slices of data in round-robin fashion. As computation requirements shift with time, the load should remain balanced. This model works well for this program because there is no communication pattern based on location of members. In this example, a computer is playing chess. In choosing its next move, it will analyze responses to all possible moves for one or more rounds into the future.
Different moves require different amounts of computation.
One may allow checkmate on the next response, so can be eliminated immediately. Others may require projection further into the future. No interaction between members When analyzing one move, no information is needed about other moves. The figure shows the Master process on the left, ready to distribute data on possible moves to the Workers. When a Worker is finished analyzing a move, the Master assigns it another move to analyze.