论文信息 - A note on superlinear speedup

A note on superlinear speedup

Abstract In the July 1986 edition of Parallel Computing two articles appeared claiming A resp. - A were true, where A is the statement that in parallel algorithms superlinear speedup can be achieved. This paper tries to resolve the controversy.

R. Janßen

[1] D. Parkinson. Parallel efficiency can be greater than unity , 1986, Parallel Comput..

[2] Vance Faber,et al. Superlinear speedup of an efficient sequential algorithm is not possible , 1986, Parallel Comput..