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


Groups > comp.programming > #6602

Finally my great updated C++ synchronization objects library is here...

Newsgroups comp.programming
Date 2016-05-10 17:02 -0700
Message-ID <0d655017-c72d-48ee-afcd-9e85011f7bf5@googlegroups.com> (permalink)
Subject Finally my great updated C++ synchronization objects library is here...
From aminer68@gmail.com

Show all headers | View raw


Hello,

Finally my great updated C++ synchronization objects library is here... 

I have corrected the bug with my scalable Asymmetric Distributed Reader-Writer mutex , and now i have modified some logic inside it, and now 
it uses the windows FlushProcessWriteBuffers() on the writer side of my algorithm that executes a Full memory barrier on the other processors so that the variables that are needed by the writer side of my algorithm are visible. So you have to understand that declaring a variable volatile in C++ is not a sufficient condition to make the variable visible across cores, you need to execute a Full memory barrier, and this is what is doing the windows function FlushProcessWriteBuffers() on the writer side of my algorithm. 


Now i need to make my new scalable Asymmetric Distributed Reader-Writer Mutex algorithm  more clear, the Dmitry Vyukov scalable Asymmetric rw_mutex here:

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

This algorithm when it makes "writer_pending = true", it will block 
all the readers the time needed for the following loop to execute:

for (int i = 0; i != max_reader_count; ++i) 
        { 
            // wait for all readers to complete 
            while (reader_inside[i]) 
                SwitchToThread(); 
        } 


An this is expensive and not efficient, but my new algorithm that 
is my scalable Asymmetric Distributed Reader-Writer Mutex algorithm,
doesn't block like that the reader threads, since in my new algorithm even if you enter like this loop above, the reader-side can still execute in parallel when the loop is not yet finished, 
and this what makes my scalable Asymmetric Distributed Reader-Writer Mutex algorithm efficient, it has more parallelism than the Dmitry Vyukov scalable Asymmetric rw_mutex.


If you need to take a look at my new algorithm, just download the 
source code , just look at version 2 of my algorithm
inside DRWLOCK.pas source code, you can download the source code 
from here:

https://sites.google.com/site/aminer68/scalable-distributed-reader-writer-mutex

So hope that you will be happy with my great C++ synchronization objects library ! 


You can download my new and updated C++ synchronization objects library
from:

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



Thank you,
Amine Moulay Ramdane.





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


Thread

Finally my great updated C++ synchronization objects library is here... aminer68@gmail.com - 2016-05-10 17:02 -0700

csiph-web