Worley, Patrick H. The effect of time constraints on scaled speedup. (English) Zbl 0725.65154 SIAM J. Sci. Stat. Comput. 11, No. 5, 838-858 (1990). The scaled speedup curve is a function of how the size of the problem is allowed to grow. In this paper, it is shown that allowing the size of problem to grow to fill the available memory can produce dramatically different results from allowing the size of a problem to grow subject to satisfying an upper bound on the execution time. In particular, if a constraint on the execution time is enforced, then the scaled speedup curve is often very similar to the speedup curve for a fixed size problem. For other problems, it is shown that the scaled speedup curve indicates that massively parallel computers will be useful even if the execution time is constrained. In all the cases considered, a meaningful interpretation of the scaled speedup curve depends on a constraint on the execution time. Reviewer: M.A.Noor (Riyadh) Cited in 1 Document MSC: 65Y05 Parallel numerical computation 68W15 Distributed algorithms Keywords:massively parallel computation; problem scaling; scaled speedup curve; execution time PDFBibTeX XMLCite \textit{P. H. Worley}, SIAM J. Sci. Stat. Comput. 11, No. 5, 838--858 (1990; Zbl 0725.65154) Full Text: DOI