Power-of-Two Hash Table Size
"Any data structures 101 book will say choose a prime for the
number of buckets, so that the bucket's index can easily be computed
by h(k) = k mod m, where k is the key value and m is the bucket size.
While this approach is straight-forward, there are a number of issues
with it, including slow modulo performance. ConcurrentHashMap instead
uses a power-of-two rule"
>But the scalability of parallelhashlist does depend on the data keys
>that are presented to parallelhashlist, when the data keys are hashed
>and are very well distributed across the segments, in fact you can
>get a perfect 4X scaling both on reads and writes.
I mean a perfect scaling on 4 cores...
Amine Moulay Ramdane.