Author: Ingo Althofer
Date: 03:12:30 05/11/98
Go up one level in this thread
On May 10, 1998 at 00:52:18, Keith Ian Price wrote: >Sorry for the delay. Here is Part III of my Deep Blue Report: First of all again many thanks to Keith Price for his informative report ! If all CCC-contributions were of this calibre ... Then, please excuse the strange format of this reply. It is my poor hardware and software equipment, which does not allow formating. Concerning the quote (very) below I simply want to mention that there is a diplom thesis written by Juergen Harting at the University of Bielefeld in 1991, in which he analyses such a two-level parallel algorithm for game tree search with quadratically many processors. He was able to prove a linear speedup. Ingo Althoefer. >Other differing reports about how >many processors DB used were also answered. Deep Blue employed 30 SP2 >Scalable Processors. The frames were capable of holding sixteen each, >and there were two frames, but in each frame, two processors were tied >together to form a master processor, which meant a total of 30 instead >of thirty-two. Each SP2 had 16 chess processors attached, so that meant >a total of 480 chess processors. Up until this point I had only heard >256 or 512. Hsu said that Deep Blue used "two-level parallelism" to >process positions. He described this as the method of the master >processor evaluating the first 4 moves, then sending the 1000 or so >positions involved to the other SP2s, which would carry it out for >another 4 moves, and then turn over the positions to the chess >processors, which would go on for 4-5 more moves. ...
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.