Superlinear speedup of an efficient sequential algorithm is not possible

DOI10.1016/0167-8191(86)90024-4MaRDI QIDQ1079368zbMATH OpenOpenAlexFDO

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

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

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

Cited in

(3)

• Data-movement-intensive problems: Two folk theorems in parallel computation revisited
• Efficiency considerations in the implementation of parallel branch-and- bound
• KiT-RT: an extendable framework for radiative transfer and therapy

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079368)