You have to know me more..

[Sky89]

Hello,


You have to know me more..

You will think that i am stupid because i use modern Object Pascal
of Delphi and FreePascal that supports inline assembler and generics
etc. but as you are noticing i am not stupid because i am an "inventor"
of many "scalable" algorithms, i am "making" the world with my my kind
of smartness, i am not waiting for the "standards" of Java or the
standard of C++ or Rust, because they are also inferiority because
many of there algorithms are not "scalable", this is why i am here,
because i have brought my scalable algorithms to Delphi and FreePascal
and C++, look at my following last invention that is:

Scalable reference counting with efficient support for weak references

https://sites.google.com/site/aminer68/scalable-reference-counting-with-efficient-support-for-weak-references

Where do you will find it ? you will not find it in C++ and you will not
find it in ADA. This is why i am here, i am making the world ! i am not
waiting for C++ or Java or Rust. This is how you have to be this kind of
smartness ! i have also invented a scalable queue and a scalable
Threadpool and many of my other scalable algorithms.

And look for example at my efficient Threadpool engine that scales very
well here:

https://sites.google.com/site/aminer68/an-efficient-threadpool-engine-that-scales-very-well

It says this:

More precision about my efficient Threadpool that scales very well, my
Threadpool is much more scalable than the one of Microsoft, in the
workers side i am using scalable counting networks to distribute on the
many queues or stacks, so it is scalable on the workers side, on the
consumers side i am also using lock striping to be able to scale very
well, so it is scalable on those parts, on the other part that is work
stealing, i am using scalable counting networks, so globally it scales
very well, and since work stealing is "rare" so i think that my
efficient Threadpool that scales very well is really powerful, and it is
much more optimized and the scalable counting networks eliminate false
sharing, and it works with Windows and Linux.

So as you have noticed i am making the world and not waiting for Java or
C++ or Rust.

Also look at my Parallel Compression Library and my Parallel archiver,
you will not find them anywhere, read about them and you will notice it,
they are NUMA efficient and now my Parallel compression library and my
Parallel archiver are optimized for NUMA and they support processor
groups on windows and they use only two threads that do the IO (and they
are not contending) so that it reduces at best the contention, so that
they scale well, also now the process of calculating the CRC is much
more optimized and is fast, and the process of testing the integrity is
fast. I have done a quick calculation of the scalability prediction for
my Parallel Compression Library, and i think it's good: it can scale
beyond 100X on NUMA systems, read about them and download them from here

https://sites.google.com/site/aminer68/parallel-archiver

https://sites.google.com/site/aminer68/parallel-compression-library


And you will find many of my scalable algorithms implementation here:

https://sites.google.com/site/aminer68/




Thank you,
Amine Moulay Ramdane.