Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Dann's multiple cpu program

Author: Dann Corbit

Date: 10:55:51 11/10/99

Go up one level in this thread


On November 10, 1999 at 04:20:21, Bas Hamstra wrote:
>It looks like threads will be continually created and destroyed. Doesn't that
>give a lot of overhead?
Actually, the threads will not ever be destroyed and all are created at startup.
 The pool of threads will use event synchronization to change tasks.  The main
thread will always have a full CPU, so it will have the full benefit a standard
engine would.  It will act like a conventional chess program, but it will get
special information contributed by the other threads.  A second thread (mate
solver) will always have a full CPU, so it will find any mate a mate solver
would find.  I will ask Heiner Marxen about using his mate engine at some point,
otherwise I will have to write my own.  Anyway, his mate solver is light years
ahead of all the rest.  The other threads will get new assignments, continue, or
abandon tasks as scheduled.  I don't know how to explain it better, but I see
the image clearly in my mind.



This page took 0.01 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.