Is average superlinear speedup possible?
- 9 June 2005
- book chapter
- Published by Springer Nature
- p. 301-312
- https://doi.org/10.1007/bfb0026309
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the average case complexity of backtracking for the exact-satisfiability problemPublished by Springer Nature ,1988
- Superlinear speedup for parallel backtrackingPublished by Springer Nature ,1988
- Parallel efficiency can be greater than unityParallel Computing, 1986
- Superlinear speedup of an efficient sequential algorithm is not possibleParallel Computing, 1986
- Performance of parallel branch-and-bound algorithmsIEEE Transactions on Computers, 1985
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984