Discussion of chess software programming and technical issues.
Moderators: hgm , Rebel , chrisw
flok
Post
by flok » Fri Mar 17, 2017 11:32 am
Hi,
While trying to figure out why my multithreading implementation does not give any improvements, I noticed that the number of TT hits versus the node count does hardly change.
Is this to be expected?
Code: Select all
256MB hash
threads nodes nps tt hits time tthits/nodes
0 968986 567 21266 1.669 0.0219466535
1 1057584 871 23024 1.186 0.0217703747
2 1335666 754 31138 1.73 0.0233127144
3 1266007 788 29133 1.57 0.0230117211
4 1913776 648 44345 2.887 0.0231714683
5 2520574 620 63120 3.976 0.0250419151
smatovic
Posts: 2658 Joined: Wed Mar 10, 2010 10:18 pm
Location: Hamburg, Germany
Full name: Srdja Matovic
Post
by smatovic » Fri Mar 17, 2017 2:26 pm
maybe you could try to run n independent threads at first,
so all counters should increase thread wise,
to be sure of proper usage of per thread memory and shared memory...
e.g., stepwise implementation of parallel search by Tom Kerrigan:
http://talkchess.com/forum/viewtopic.ph ... torder=asc
--
Srdja