About hash function collision and scalability..

[Amine Moulay Ramdane]

Hello..


About hash function collision and scalability..

About Birthday’s paradox(https://en.wikipedia.org/wiki/Birthday_problem): Wikipedia gives us an approximation to the collision probability assuming that the number of objects r is much smaller than the number of possible values N: 1-exp(-r**2/(2N)).

This is a so important result, since my good 32 bit hash functions
in my following software projects can attain only a probability of 50% for a collision at around 77000 cores and and 77000 threads, so it is good for scalability even if i am not using a good 64 bit hash function,
(but i will soon upgrade them to a good 64 bit hash function),
so here is my following software projects:

My scalable parallel varfiler here:

https://sites.google.com/site/scalable68/scalable-parallel-varfiler

And my parallel C++ and Delphi implementations of conjugate gradient sparse linear system solver libraries that scales very well here:

https://sites.google.com/site/scalable68/scalable-parallel-c-conjugate-gradient-linear-system-solver-library

https://sites.google.com/site/scalable68/scalable-parallel-implementation-of-conjugate-gradient-sparse-linear-system-solver

And my scalable RWLock that works across processes and threads here:

https://sites.google.com/site/scalable68/scalable-rwlock-that-works-accross-processes-and-threads

And my Parallel HashList that scales well here:

https://sites.google.com/site/scalable68/scalable-parallel-hashlist



Thank you,
Amine Moulay Ramdane.

[Bonita Montero]

> And my Parallel HashList that scales well here:
> https://sites.google.com/site/scalable68/scalable-parallel-hashlist

# "and my scalable RWLock in each bucket of the parallel hashtable"

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.

[Amine Moulay Ramdane]

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.

[Bonita Montero]

>> 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*+.