Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #2755
| From | Ramine <ramine@1.1> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | About the distributed reader-writer mutex |
| Date | 2014-12-07 13:32 -0800 |
| Organization | A noiseless patient Spider |
| Message-ID | <m626dn$14h$2@dont-email.me> (permalink) |
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,
Back to comp.programming.threads | Previous | Next — Next in thread | Find similar | Unroll thread
About the distributed reader-writer mutex Ramine <ramine@1.1> - 2014-12-07 13:32 -0800 Re: About the distributed reader-writer mutex Ramine <ramine@1.1> - 2014-12-07 13:45 -0800
csiph-web