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


Groups > comp.programming.threads > #4849 > unrolled thread

Read again, more precision again

Started byHorizon68 <horizon@horizon.com>
First post2019-01-02 08:29 -0800
Last post2019-01-02 08:29 -0800
Articles 1 — 1 participant

Back to article view | Back to comp.programming.threads


Contents

  Read again, more precision again Horizon68 <horizon@horizon.com> - 2019-01-02 08:29 -0800

#4849 — Read again, more precision again

FromHorizon68 <horizon@horizon.com>
Date2019-01-02 08:29 -0800
SubjectRead again, more precision again
Message-ID<q0iot1$v0b$18@dont-email.me>
Hello...


Read again, more precision again:

I have just looked at the following Scalable hash map:

https://groups.google.com/forum/#!topic/lock-free/qCYGGkrwbcA


As you can read that its cost of read transaction (find operation) is 
about 30 cycles, this is what makes it interesting.

But you have to know that i have "invented" the following scalable 
algorithms and there implementations, read about them:

"LW_Asym_RWLockX that is a lightweight scalable Asymmetric Reader-Writer 
Mutex that uses a technic that looks like Seqlock without looping on the 
reader side like Seqlock, and this has permited the reader side to be 
costless, it is FIFO fair on the writer side and FIFO fair on the reader 
side and it is of course Starvation-free and it does spin-wait, and  my 
Asym_RWLockX, a lightweight scalable Asymmetric Reader-Writer Mutex that 
uses a technic that looks like Seqlock without looping on the reader 
side like Seqlock, and this has permited the reader side to be costless, 
it is FIFO fair on the writer side and FIFO fair on the reader side and 
it is of course Starvation-free and it does not spin-wait, but waits on 
my SemaMonitor, so it is energy efficient."

You can download them from my website:

https://sites.google.com/site/scalable68/c-synchronization-objects-library


And as you have noticed since my scalable algorithms above are costless 
in the reader side , so i will use them in my following scalable 
parallel hashtable to make it scalable and costless in the reader side 
of my scalable Asymmetric Reader-Writer Mutex:

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


And i will use them inside my following scalable Parallel Varfiler  to 
make it scalable and costless in the reader side of my scalable 
Asymmetric Reader-Writer Mutex:

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


And I just "enhanced" my Scalable Parallel Varfiler benchmarks,
please run the following multicore benchmark for my scalable Parallel 
Varfiler called "test3.exe" that you will find inside the zip file , you
can download the zip file from:

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


And you can download my Scalable Parallel Varfiler from:

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



Thank you,
Amine Moulay Ramdane.

[toc] | [standalone]


Back to top | Article view | comp.programming.threads


csiph-web