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.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)