Superlinear speedup of an efficient sequential algorithm is not possible

DOI10.1016/0167-8191(86)90024-4zbMath0597.68044OpenAlexW2001020450MaRDI QIDQ1079368

Andrew B. jun. White, Vance Faber, Olaf M. Lubeck

Publication date: 1986

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(86)90024-4

zbMATH Keywords

parallel algorithmparallel processing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Related Items (2)

Data-movement-intensive problems: Two folk theorems in parallel computation revisited ⋮ Efficiency considerations in the implementation of parallel branch-and- bound

This page was built for publication: Superlinear speedup of an efficient sequential algorithm is not possible