Read this, it is important

[Ramine]

Hello,


Hope you have read my previous post..

But look now at the source code of my SeqlockX algorithm here:

https://sites.google.com/site/aminer68/scalable-seqlockx

There is a load on x86 on the reader side section of my SeqlockX
algorithm like this:

myid2:=FCount4^.fcount4;


This is why it works , because loads and stores on x86 are
not reordered with this load above, so it permit my SeqlockX to
not use any atomics or fences on the the reader side.

So i think that's not possible with this Asymmetric rw_mutex from Dmitry
Vyukov as i have explained before:

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


And i think that's not possible with my scalable Asymmetric
Distributed reader-writer mutex, because it needs an x86 fence
on the reader side of the critical section.

So if you need a costless sychronization mechanism on the reader side
that elminates livelock when there is more writers, use my
SelqockX implementation of my algorithm.


Hope you have understood what i mean.


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

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



Thank you,
Amine Moulay Ramdane.