Incremental mapping for solution-adaptive multigrid hierarchies

Author

De Keyser, J. ; Roose, D.

Author_Institution

Dept. of Comput. Sci., Katholieke Univ. Leuven, Belgium

fYear

1992

fDate

26-29 Apr 1992

Firstpage

401

Lastpage

408

Abstract

The full multigrid method uses a hierarchy of successively finer grids. In a solution-adaptive grid hierarchy each grid is obtained by adaptive refinement of the grid on the previous level. On a distributed memory multiprocessor, each grid level must be partitioned and mapped so as to minimize the multigrid cycle execution time. In this report, several grid partitioning and load (re)mapping strategies that deal with this problem are compared. The influence of the type of multigrid cycle is examined. Results obtained on an iPSC hypercube are reported

Keywords

distributed memory systems; hypercube networks; iterative methods; linear algebra; parallel algorithms; partial differential equations; distributed memory multiprocessor; grid partitioning; iPSC hypercube; incremental mapping; load remapping; multigrid cycle execution time; solution-adaptive multigrid hierarchies; Computer science; Data structures; Differential equations; Hypercubes; Iterative methods; Load management; Multigrid methods; Partial differential equations; Runtime; Supercomputers;

fLanguage

English

Publisher

ieee

Conference_Titel

Scalable High Performance Computing Conference, 1992. SHPCC-92, Proceedings.

Conference_Location

Williamsburg, VA

Print_ISBN

0-8186-2775-1

Type

conf

DOI

10.1109/SHPCC.1992.232666

Filename

232666