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.
Dynamic load balancing The specific work assigned to processes is determined at run time.
The communication pattern is one to all This program will not scale if there is one process managing the pool of tasks. The Master will become a bottleneck as the number of Workers increases. In this section we will walk through the parallel program development of a simple problem. This problem was developed from a description found in Fox et al. Solving Problems on Concurrent Processors, vol.