Straightforward partitioning of composite grids for explicit difference methods

A straightforward partitioning strategy is analyzed for the case of explicit difference methods on composite grids. The computer is assumed to be of MIMD type with distributed memory. The amount of computational work at the boundary points is assumed to differ from that at the interior points. Theoretical estimates of the efficiency show that the straightforward strategy will be sufficiently efficient for problems with a relatively small work load at the boundary points, a modest number of processors, and close to square grids. For problems that are far from having these properties, a more sophisticated partitioning strategy is needed.