algorithm - how to partition the 2d arrays among the processes for "The Game of Life"

Question

I am doing an assignment using MPI to implement Game of Life. I was wondering if I should use a block-row partitioning, a cyclic row partitioning or a block-checkerboard partitioning?

Answer 1

What are the pros and cons between the types of partitioning? I tried to find references to the partitionings (which seems to tie in with parallell processing) but it was difficult to find such without going way over my head into it. :)

Try the one that fits your needs the most, since it is an assignment you should try the simplest one first and do the others when time allows.

Answer 2

不管你怎么做，不要忘记让你的分区在每一侧都更大，并有一些重叠。

这将意味着复制一些数据，但这也意味着每个分区都可以独立计算。在每个刻度结束时，您的分区可以将它们的重叠复制到它们的邻居。