Path: utzoo!utgpu!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!rutgers!gatech!hubcap!dfk
From: dfk@romeo.cs.duke.edu (David F. Kotz)
Newsgroups: comp.parallel
Subject: Superlinear
Summary: references
Message-ID: <3782@hubcap.UUCP>
Date: 7 Dec 88 13:21:49 GMT
Sender: fpst@hubcap.UUCP
Lines: 23
Approved: parallel@hubcap.clemson.edu

In article <3755@hubcap.UUCP>, robison@m.cs.uiuc.edu (Arch Robison) writes:
> I'm looking for references (either pro or con) on the following claim:
> 
> 	A p-processor parallel processor can never exhibit speedup
> 	of greater than p.

Try these, all short: 

D. Parkinson, "Parallel Efficiency can be greater than unity",
Parallel Computing 3 (1986) 261-262. 

V. Faber, Olaf M. Lubeck and Andrew B. White, Jr, "Superlinear speedup
of an efficient sequential algorithm is not possible", Parallel
Computing 3 (1986) 259-260. 

"Isomorphic Computers, Ltd", International Journal of Parallel
Programming, Vol 16, No 2, 1987, pp 179-182.

David Kotz
Department of Computer Science, Duke University, Durham, NC 27706
ARPA:	dfk@cs.duke.edu
CSNET:	dfk@duke        
UUCP:	decvax!duke!dfk