Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Incremental mapping for solution-adaptive multigrid hierarchies

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

2 Author(s)
De Keyser, J. ; Dept. of Comput. Sci., Katholieke Univ. Leuven, Belgium ; Roose, D.

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

Published in:

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

Date of Conference:

26-29 Apr 1992