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.
I have not done a lockless hashtable yet. I'm tempted to use double
wide CAS and be done with it, but I don't know if that'll work on 64
bit machines.
Sent from my iPhone
On Apr 13, 2009, at 5:03 PM, Michael Williams <michaelwilliam...@gmail.com
> wrote:
What tricks are people doing to minimize the performance degradation
due to multiple threads contending for access to the tree (in
MCTS)? Do you only lock a portion of the tree? How would that work?
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
