A PARTITIONING ALGORITHM FOR COMPOSITE GRIDS
Michael Thuné · International Journal of Parallel Emergent and Distributed Systems · 1993
A partitioning algorithm is presented, which applies to composite grids for explicit difference methods. Results from four case studies are promising. In fact, close to optimal partitionings were generated by the algorithm. The new algorithm is intended for use in a set of software tools for parallelization of explicit difference methods on MIMD (multiple instruction, multiple data) computers with distributed memory.