Jason House wrote:
I use atomic increments and atomic reads. It's really simple x86
assembly. To do that, I used to have a counter for wins and a total
simulations counter, but switched to wins and losses counter. Doing
that allows independent increments to those counters.
In my implementation, I found that node allocation is the most difficult
part. For a tree, I suppose it may be done easily by pre-allocating a
node pool for each thread, and managing memory allocation locally. A
hash table could use a similar scheme. I believe this is what Cliff
Click Jr. calls "striping". But according to his talk, it is less
efficient than the test-and-set approach.
Rémi
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
