Programming Abstractions for Dynamically Partitioning and Coordinating Localized Scientific Calculations Running on Multiprocessors

Certain software abstractions help to automate load balancing during various math-physics calculations on a team of concurrently executing processors. These abstractions have been tested on a vortex method for computational fluid dynamics. Experiments exhibited good parallel speedups of 24 and 3.6,r...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:SIAM journal on scientific and statistical computing Ročník 12; číslo 1; s. 145 - 157
Hlavný autor: Baden, Scott B.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.1991
Predmet:
Communication
Exact sciences and technology
Fluid dynamics
Mathematics
Methods of scientific computing (including symbolic computation, algebraic computation)
Numerical analysis. Scientific computation
Sciences and techniques of general use
Software upgrading
Workloads
Multiprocessor
Euler equation
Load distribution
Software tool
Numerical computation
Portability
Computing
Dynamic method
ISSN:0196-5204, 1064-8275, 2168-3417, 1095-7197
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Certain software abstractions help to automate load balancing during various math-physics calculations on a team of concurrently executing processors. These abstractions have been tested on a vortex method for computational fluid dynamics. Experiments exhibited good parallel speedups of 24 and 3.6,respectively, on 32 processors of the Intel iPSC-1--a message-passing hypercube architecture--and on 4 processors of a Cray X-MP--a shared-memory vector architecture. The abstractions should apply to diverse applications, including finite difference methods, and to diverse architectures without requiring that the application be reprogrammed extensively for each new architecture.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0196-5204
1064-8275
2168-3417
1095-7197
DOI:10.1137/0912008