Evaluating speedups on distributed memory architectures (Q1119334)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Evaluating speedups on distributed memory architectures |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Evaluating speedups on distributed memory architectures |
scientific article |
Statements
Evaluating speedups on distributed memory architectures (English)
0 references
1989
0 references
Using two implementations of the Gaussian elimination on a hypercube multiprocessor the authors compare two different ways of evaluating the speedup of parallel algorithms on a distributed memory machine, namely the usual and Gustafson's speedups. Also an analytical performance formula is given which shows the increase in performance that can be achieved with the multiplication of the hardware (processor, memory,...).
0 references
performance evaluation
0 references
Gaussian elimination
0 references
hypercube multiprocessor
0 references
speedup
0 references
parallel algorithms
0 references
