Approximate Speedup by Independent Identical Processing
Abstract
In this paper we prove that for algorithms which proceed to the
next state based on information available from the current state, identical independent parallel processing using stochastic multistart methods always yields a speedup in the expected time to hit a goal which
is locally exponential in the number of processors.