DocumentCode
2355560
Title
An alternative to data mapping for parallel PDE solvers: parallel grid generation
Author
Chrisochoides, Nikos P.
Author_Institution
Dept. of Comput. Sci., Syracuse Univ., NY, USA
fYear
1993
fDate
6-8 Oct 1993
Firstpage
36
Lastpage
44
Abstract
In this paper we identified and outlined the disadvantages of the traditional data mapping methods for the numerical solution of PDEs on distributed memory MIMD machines and we proposed a new approach that eliminates some of the disadvantages. Specifically, we presented a data-mapping approach based on parallel structured grid generation. The new approach is based on composite block structures to contract the size of the data-mapping problem. It is ten times faster than the fastest traditional data-mapping method, for relatively small problems, and approximately O(P) times faster, for very large problems (i.e., millions of grid points) that are processed on coarse-grain distributed memory MIMD machines with P processors
Keywords
mesh generation; parallel algorithms; partial differential equations; MIMD machines; coarse-grain; data mapping; distributed memory; distributed memory MIMD machines; numerical solution; parallel PDE solvers; parallel grid generation; parallel structured grid generation; Bismuth; Clustering algorithms; Computer science; Contracts; Educational institutions; Mesh generation; Optimization methods; Parallel architectures; Parallel processing; Partitioning algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Scalable Parallel Libraries Conference, 1993., Proceedings of the
Conference_Location
Mississippi State, MS
Print_ISBN
0-8186-4980-1
Type
conf
DOI
10.1109/SPLC.1993.365584
Filename
365584
Link To Document