By Topic

An alternative to data mapping for parallel PDE solvers: parallel grid generation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chrisochoides, N.P. ; Dept. of Comput. Sci., Syracuse Univ., NY, USA

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

Published in:

Scalable Parallel Libraries Conference, 1993., Proceedings of the

Date of Conference:

6-8 Oct 1993