On superlinear speedups
type: Item
instance of: scholarly article
title: On superlinear speedups
zbMATH Open document ID: 0739.68001
DOI: 10.1016/S0167-8191(05)80060-2
author: Dietrich Fischer
published in: Parallel Computing
publication date: 1992-06-26T00:00:00Z
review text: \textit{R. Janssen} [Parallel Comput. 4, 211-213 (1987; Zbl 0641.68070)] proposed an algorithm for which the use of \(n\) processors can reduce computer time by more than a factor of \(n\). It is shown that in the example that Janssen offered the superlinear speedup was possible only due to inefficient programming of the algorithm on a single processor. Yet Janssen's claim is correct, as shown by another example.
Mathematics Subject Classification ID: 68M07
zbMATH DE Number: 24132
zbMATH Keywords: efficiency
zbMATH Keywords: parallel processors
zbMATH Keywords: superlinear speedup
MaRDI profile type: Publication
full work available at URL: s0167-8191(05)80060-2
OpenAlex ID: W8152169
description: scientific article; zbMATH DE number 24132