Author: Dann Corbit
Date: 17:02:45 09/25/01
Go up one level in this thread
Superlinear speedup might be possible, even on average, but it would be due to a change in algorithm. For instance, you can employ a completely different algorithm for parallel sorting which will sort faster than any known serial algorithm. Even if you divide up the work for the serial technique, the parallel algorithm will beat it because the fundamental algorithm is superior.
This page took 0.05 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.