Optimal tilings for iterative PDE solvers

Author

Terrano, Anthony E.

Author_Institution

Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA

fYear

1988

fDate

10-12 Oct 1988

Firstpage

227

Lastpage

229

Abstract

A simple, universal procedure for deriving the optimal partition for a given iterative partial differential equation (PDE) algorithm is presented. A previous analysis is extended to include geometrical considerations-in particular, the relative orientation of the update stencil and the partition tile. On the basis of this procedure, two new partitionings are derived for specific PDE algorithms which are more efficient than any previously known. The choice of partition is found to be independent of the details of the multiprocessor architecture for a wide range of operating parameters

Keywords

iterative methods; parallel algorithms; partial differential equations; geometrical considerations; iterative PDE solvers; multiprocessor architecture; operating parameters; optimal partition; optimal tilings; partition tile; update stencil; Algorithm design and analysis; Computer architecture; Concurrent computing; Iterative algorithms; Multiprocessor interconnection networks; Parallel algorithms; Partial differential equations; Partitioning algorithms; Shape; Tiles;

fLanguage

English

Publisher

ieee

Conference_Titel

Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of

Conference_Location

Fairfax, VA

Print_ISBN

0-8186-5892-4

Type

conf

DOI

10.1109/FMPC.1988.47481

Filename

47481