Author: Charles Roberson
Date: 14:04:23 02/26/04
Go up one level in this thread
On February 26, 2004 at 12:06:10, Anthony Cozzie wrote: >On February 26, 2004 at 11:18:07, Charles Roberson wrote: > >> >> The second algorithm reminds me of Bob's paper on DTS or any other work >> stealing approach. > >I don't think DTS really suggested a split strategy (other than split at ALL >nodes if possible). Bob's paper is more, "how can we design a parallel >structure so that we can split anywhere in the tree". Once you have a working >DTS implementation, you can split however you want . . . > >anthony Work stealing algorithms typically try to reduce the overhead of finding a processor that needs help by assigning the free processor to the one the has the most work left to do. I see Bob's work as help for work stealing algorithms.
This page took 0 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.