Parallel computing and domain decomposition
Conference
·
OSTI ID:5439247
- Argonne National Laboratory (ANL), Argonne, IL (United States)
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.
- Research Organization:
- Argonne National Laboratory (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 5439247
- Report Number(s):
- ANL/CP--73910; CONF-9105217--2; ON: DE91017967
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Linked‐Cell Domain Decomposition Method for Molecular Dynamics Simulation on a Scalable Multiprocessor
PCCM2: A GCM adapted for scalable parallel computers
A parallel domain decomposition finite element method for massively parallel computers
Journal Article
·
Sun Oct 25 19:00:00 EST 1992
· Scientific Programming
·
OSTI ID:1197883
PCCM2: A GCM adapted for scalable parallel computers
Conference
·
Fri Dec 31 23:00:00 EST 1993
·
OSTI ID:10114472
A parallel domain decomposition finite element method for massively parallel computers
Journal Article
·
Tue Nov 30 23:00:00 EST 1993
· Computing Systems in Engineering
·
OSTI ID:55825