Evaluating speedups on distributed memory architectures
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,...).
scientific article; zbMATH DE number 4098610