It seems that in your Put function you are creating a new hashTable for 
every single put with the values from the existing hashTable being moved 
over to the new hashTable. Why are doing that? Just add the new value for 
the given key to the hashTable for the segment obtained by key.Hash() % 16 
and you are done. 

Am Donnerstag, 6. September 2018 15:00:18 UTC+2 schrieb Robert Engels:
>
> Hi, 
>
> I posted this to golang-dev, and the consensus seems to be this is a 
> better forum to address the issue? 
>
> Anyway, you can review the project 
> https://github.com/robaho/go-concurrency-test 
>
> The readme.md details the experiment. 
>
> It does some analysis of the Go concurrency primitives, in the context of 
> writing a ‘shared cache’. The conclusion is that there is a lot of room for 
> improvement, at least when compared to Java. 
>
> With a larger audience it might be possible for someone to actually run 
> the test (strange how people see the results and critique without ever even 
> attempting to run them…), hopefully on additional platforms like Linux, and 
> possibly a higher core machine (and then increase the number of threads). 
>
> Anyway, let me know your thoughts. Thanks. 
>
>
>
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"golang-nuts" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to golang-nuts+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

Reply via email to