Author: Vincent Diepeveen
Date: 15:29:16 07/19/05
Go up one level in this thread
On July 19, 2005 at 15:04:38, Joachim Rang wrote: Joachim, there are 2 important things in parallel search: a) scaling b) speedup First important goal is good scaling. At big supercomputers, assuming you use YBW as the parallel algorithm, your ONLY goal is a good scaling. Vincent > >> >>Please post the nodes per second for 1 and more threads obtained when searching >>the below position for around 60 seconds. > >nodes per second? There is no worse indicator how well a program scale than >nodes per second. It is easy to achieve perfect scalablity by simply letting all >threads calculating the same. > >To measure scalability one has to invest quite an effort. The Hydra-Team does it >with a special testsuites which take about 24hours to run. The cheap approach >would be: > >Take 10 positions and note the timetodpth for depth say 18. Than calculate the >average timetodept18 and compare. > >Even that approach is not perfect since a 18ply-search on a single processor has >a different quality than on a dual. > >regards Joachim
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.