Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming.threads > #6244

Re: About hash function collision and scalability..

Show all headers | View raw

>> What a nonsense. Parallel hash-tables have a lock per 2^N-section
>> of the hashtable and the number of sections has to be chosen that
>> there's low likehood of collision on that parts. But a lock per
>> bucket is a waste of resources.

> Take a look carefully at the source code, you also can set from the constructor
> how many of my scalable rwlocks  to use for the hashtable so that to not waste resources.

There are three increments in wich people get close to your code.
1. The language is the same they use: they read the code for curiosity.
2. The language is the same they use: they read the code and build
    their own code derived from that.
3. The language is the same they use: they directly take your code
    and use it.
But they almost never would even read your code when it is written
in an abandonned language like Pascal.
So if you want to get noticed at least write your code in a more
commonly used language like C or C*+.

Back to comp.programming.threads | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

About hash function collision and scalability.. Amine Moulay Ramdane <aminer68@gmail.com> - 2021-01-16 12:22 -0800
  Re: About hash function collision and scalability.. Bonita Montero <Bonita.Montero@gmail.com> - 2021-01-17 10:00 +0100
    Re: About hash function collision and scalability.. Amine Moulay Ramdane <aminer68@gmail.com> - 2021-01-17 07:20 -0800
      Re: About hash function collision and scalability.. Bonita Montero <Bonita.Montero@gmail.com> - 2021-01-17 19:36 +0100

csiph-web