The fast adaptive composite grid method (FAC) is an algorithm that uses various levels of uniform grids (global and local) to provide adaptive resolution and fast solution of PDEs. Like all such methods, it offers parallelism by using possibly many disconnected patches per level, but is hindered by the need to handle these levels sequentially. The finest levels must therefore wait for processing to be essentially completed on all the coarser ones. A recently developed asynchronous version of FAC, called AFAC, completely eliminates this bottleneck to parallelism. This paper describes timing results for AFAC, coupled with a simple load balancing scheme, applied to the solution of elliptic PDEs on an Intel iPSC hypercube. These tests include performance of certain processes necessary in adaptive methods, including moving grids and changing refinement. A companion paper reports on numerical and analytical results for estimating convergence factors of AFAC applied to very large scale examples.
[1]
S. McCormick,et al.
Fast Adaptive Composite Grid (FAC) Methods: Theory for the Variational Case
,
1984
.
[2]
Leslie Hart,et al.
Asynchronous multilevel adaptive methods for solving partial differential equations on multiprocessors: basic ideas
,
1989,
Parallel Comput..
[3]
Chaoqun Liu,et al.
The finite volume-element method (FVE) for planar cavity flow
,
1989
.
[4]
S. McCormick,et al.
The fast adaptive composite grid (FAC) method for elliptic equation
,
1986
.
[5]
D. Quinlan,et al.
Parallel multilevel adaptive methods
,
1989
.