Author: Bruce Moreland
Date: 11:13:10 09/26/01
Go up one level in this thread
On September 25, 2001 at 20:02:45, Dann Corbit wrote: >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. Any parallel algorithm can be expressed serially, assuming that you can make the hardware do the same thing both ways. I'm an engineer, not a math guy, but the math behind that is screaming so loudly that even I can hear it. If what I've said is false, something bad has just happened to the original Turing machine. bruce
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.