Parallel computing and domain decomposition

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Domain decomposition techniques appear a natural way to make good use of parallel computers. In particular, these techniques divide a computation into a local part, which may be done without any interprocessor communication, and a part that involves communication between neighboring and distant processors. This paper discusses some of the issues in designing and implementing a parallel domain decomposition algorithm. A framework for evaluating the cost of parallelism is introduced and applied to answering questions such as which and how many processors should solve global problems and what impact load balancing has on the choice of domain decomposition algorithm. The sources of performance bottlenecks are discussed. This analysis suggests that domain decomposition techniques will be effective on high-performance parallel processors and on networks of workstations.

Original languageEnglish (US)
Title of host publicationDomain Decomposition Methods for Partial Differential Equations
PublisherPubl by Soc for Industrial & Applied Mathematics Publ
Pages349-361
Number of pages13
ISBN (Print)0898712882
StatePublished - 1992
Externally publishedYes
EventFifth International Symposium on Domain Decomposition Methods for Partial Differential Equations - Norfolk, VA, USA
Duration: May 6 1991May 8 1991

Other

OtherFifth International Symposium on Domain Decomposition Methods for Partial Differential Equations
CityNorfolk, VA, USA
Period5/6/915/8/91

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Parallel computing and domain decomposition'. Together they form a unique fingerprint.

Cite this