Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers (Q1186822)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers |
scientific article |
Statements
Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers (English)
0 references
28 June 1992
0 references
Investigation of parallelization for several versions of the algorithms named in the title (PDE stands for red-black successive overrelaxation and alternating directions implicit methods, sparse solver for triangular sparse linear system) on two experimental shared memory parallel processors: An 8 processor variant for the VAX 6300 series and a M31, consisting of 16 Micro VAX CPUs. The two computers have scalar processors with different cache design. The presence of the caches forces to use as far as possible ``local'' data with corresponding consequences for the algorithms.
0 references
Monte Carlo simulations
0 references
simplex method
0 references
fast Fourier transform
0 references
implicit methods
0 references
decomposition
0 references
multiprocessor performance
0 references
cache coherency
0 references
parallelization
0 references
algorithms
0 references
red-black successive overrelaxation
0 references
alternating directions
0 references
sparse solver
0 references
triangular sparse linear systeme
0 references
shared memory parallel processors
0 references
0 references
