论文信息 - A Partitioning Algorithm for Composite Grids

A Partitioning Algorithm for Composite Grids

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.

Michael Thuné | M. Thuné

[1] Michael Thuné. Straightforward partitioning of composite grids for explicit difference methods , 1991, Parallel Comput..

[2] W. Henshaw,et al. Composite overlapping meshes for the solution of partial differential equations , 1990 .

[3] Marsha Berger,et al. Data structures for adaptive grid generation , 1986 .

[4] Michael Thuné. A partitioning strategy for explicit difference methods , 1990, Parallel Comput..

[5] M. Thune. The partitioning problem for a class of data parallel algorithms , 1992, Parallel Comput..

[6] Horst D. Simon,et al. Partitioning of unstructured problems for parallel processing , 1991 .

[7] Stephen A. Vavasis,et al. Automatic Domain Partitioning in Three Dimensions , 1991, SIAM J. Sci. Comput..

[8] Michael Thuné,et al. Portability and data structures in scientific computing : Object-oriented design of utility routines in Fortran , 1992 .

[9] David M. Nicol,et al. Rectilinear Partitioning of Irregular Data Parallel Computations , 1994, J. Parallel Distributed Comput..