About the distributed reader-writer mutex

[Ramine]

Hello,

http://www.1024cores.net/home/lock-free-algorithms/reader-writer-problem/distributed-reader-writer-mutex


I have just done a calculation on small reader sections using the
Amdahl's law(like when you are parallelizing Red Black trees or AVL
trees) using this distributed reader-writer mutex above using an rwlock
using the GetCurrentProcessorNumber() of windows, and i have compared it
to Seqlock, at 4 cores the Seqlock has 15 times speed throughput of the
distributed reader-writer mutex above, at 8 cores
the Seqlock has 4 times the speed throughtput of the distributed
reader-writer mutex above, at 16 cores the Seqlock has 2 times the speed
throughtput of the distributed reader-writer mutex above,
at 32 cores the Seqlock has the same speed throughput as the distributed
reader-writer mutex above.


So Seqlock and my scalable distributed reader-writer lock are
much faster on small reader section than the distributed reader-writer
mutex above.



Thank you,
Amine Moulay Ramdane,

[Ramine]

Hello...


This calculation was done on read-mostly scenarios.


Thank you,
Amine Moulay Ramdane.