Newsgroups: comp.parallel
From: "G. Evans" <gme@sys.uea.ac.uk>
Subject: Re: superlinear speedup ref?
Organization: University of East Anglia
Date: Sat, 15 Jul 1995 10:03:00 GMT
Message-ID: <3u83ok$v57@cpca3.uea.ac.uk>

In article <Ted.Belding-1207951713260001@pm054-25.dialip.mich.net>, Ted.Belding@umich.edu (Theodore C. Belding) writes:
|> I'm looking for a reference concerning superlinear speedup 
|> in search algorithms.  Specifically: the type of superlinear speedup 
|> obtained by running n identical serial search programs concurrently 
|> on the same problem.  (The wall clock time to solution decreases faster
|> than 1/n, under certain conditions).  Any pointers would be much 
|> appreciated.  TIA!
|> -Ted
|> 
|> --

Search anomalies (including superlinear speedup) in parallel Branch-and-Bound
algorithms are described in, for example,

T. Lai and S. Sahni, Anomalies in Parallel Branch-and-Bound Algorithms,
Communications of the ACM, 27, 1984.

I've got a number of papers on parallel Branch-and-Bound which actually
report superlinear. I can give you references in you want them.

Gareth.


