A grid based subtree-subcube assignment strategy for solving PDEs on hypercubes
Mo Mu, John R. Rice · Purdue e-Pubs (Purdue University System) · 1989
We propose a grid based subtree-subcube assignment strategy for using nested dissection in solving PDE problems on hypercubes. A complexity analysis is given for both our approach and the standard subtree-subcube assignment. The new assignment reduces communication cost by a factor of 0 (logp) in start ups and a factor of about two in traffic volume. This grid based assignment strategy achieves the optimal order in both traffic volume and start ups, it provides load balancing and as much parallelism as is inherent in the algorithm formulation. • Work supported in part by National Science Foundation grant CCR·8619817. ... Work supported in part by the Air Force Office of Scientific Research grant, 88·0243 and lhe Strategic Defense lniLiative Office contract DAAL03-86·K·OI06.