World champs 2003 i experimented with 400MB hashtable for 500 processors versus 200GB hashtable.Rebel wrote:Perhaps the hash-table-size plays a role in this? Branch factor goes up when the hash table becomes full. What happens if you triple the hash-table size for a quad?Daniel Shawul wrote:It would also be interesting to compare ratings of parallel speedups for 1,2 and 4 processors. Incidentally this seems to roughly match your tests if you assume a 1,1.8 and 3 speedups. That is generally expected efficiency for YBW implementation. The increase in elo is much lower as expected. For example I see for stockfish 2.2.1 2952 2997 3011. So with this the +70 elo per doubling estimate looks a rather good one but this of course depends on the efficiency of parallel implementation as I already mentioned.
After 10 hours of search overnight, the total searchdepth difference between those 2 searches was exactly 1 ply, which is very little.
It's a matter of a good replacement strategy.
So i 'blew' 2 nights of search of the supercomputer to something that in the end made hardly a difference.
Do not forget, old engines like cilkchess if i remember well, they did do just 1 probe. Obviously THAT is a big difference with a more mature replacement strategy.
That said - we agree that no good science has been conducted here; the experiment here of elo vs speed has flaws everywhere.