Author: Robert Hyatt
Date: 17:15:01 05/17/00
Go up one level in this thread
On May 17, 2000 at 18:20:38, Pete Galati wrote: >On May 17, 2000 at 18:03:46, Robert Hyatt wrote: > >>On May 17, 2000 at 15:33:13, Peter Hegger wrote: >> >>>Hello >>>Bob, I was wondering how many nps you will expect to hit when you get crafty up >>>and running on the Beowulf cluster. >>>Have you an approximate time frame when you think you may have the beast going? >>>Or, is that something that is unpredictable at this point? >>>Thanks, >>>Peter >> >> >>It is unpredictable. There are lots of things to do... but obviously it >>ought to hit 10M nodes per second. Whether that is 10x faster than my >>normal search on a single quad is very doubtful. But I don't think that >>hoping for 50% efficiency is out of line... which means an effective speed >>of 5M. And this is based on the current cluster. Another 8 quad xeons are >>due in this Summer, for a total of 18. That just might really hit 10M useful >>nodes per second. >> >>But lots of things are left to play with, like shared vs local transposition >>tables, carefully scheduling positions on nodes that have seen them before, >>etc... > >Just curiuous, have other programs used Beowulf clusters yet? > >Will someone with too much money in the future be able to buy a Beowulf cluster >and compile a BeoCrafty from the same source as the rest of us poor folks use >for our humble PCs? > >Pete Probably. I would hope that the beowulf version would work well on a two node machine (ie two PII/500's sitting side by side with a 100baseTx connection between them.) But once that is public, doing the same with 32 quad xeons will be just as easy, although I don't know how efficient it will be.
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.