Author: José de Jesús García Ruvalcaba
Date: 08:39:51 03/05/01
Go up one level in this thread
On March 05, 2001 at 11:18:36, Robert Hyatt wrote: >On March 05, 2001 at 03:07:09, Pham Minh Tri wrote: > >>Hi all, >> >>If a chess program runs on a computer with N processors, how many times is it >>faster? N times? (compare with the same computer with 1 processor) >> >>Just a curious question because I have no computer with multiprocessor nor >>supercomputer :-( >\ > >There are two answers. > >1. If the program was written to use a parallel search, then you get one >answer. I can't speak for everybody, but for the case of Crafty, the formula >is roughly this: > >speedup = 1 + (N-1)*.7 > >where N is the number of cpus you have. > >IE for my quad, this comes out to roughly 3.1 times faster using 4 processors. > But that is sharing the transposition tables. What sort of speedup can we expect for message-passing chess programs (in which every processor has its own hashtables)? José. >2. If the program doesn't know anything about a parallel search, then it will >get no speedup whatsoever no matter how many processors you have.
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.