Parallel implementation of domain decomposition techniques on Intel's hypercube

Parallel implementation of domain decomposition techniques for elliptic PDEs in rectangular regions is considered. This technique is well suited for parallel processing, since in the solution process the subproblems either are independent or can be easily converted into decoupled problems. More than 80% of execution time is spent on solving these independent and decoupled problems. The hypercube architecture is used for concurrent execution. The performance of the parallel algorithm is compared against the sequential version. The speed-up, efficiency, and communication factors are studied as functions the number of processors. Extensive tests are performed to find, for a given mesh size, the number of subregions and nodes that minimize the overall execution time.