Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #4970 > unrolled thread
| Started by | Ramine <ramine@1.1> |
|---|---|
| First post | 2014-12-04 19:57 -0800 |
| Last post | 2014-12-04 20:07 -0800 |
| Articles | 2 — 1 participant |
Back to article view | Back to comp.programming
About my new algorithm Ramine <ramine@1.1> - 2014-12-04 19:57 -0800
Re: About my new algorithm Ramine <ramine@1.1> - 2014-12-04 20:07 -0800
| From | Ramine <ramine@1.1> |
|---|---|
| Date | 2014-12-04 19:57 -0800 |
| Subject | About my new algorithm |
| Message-ID | <m5qvrn$o4v$4@dont-email.me> |
Chriss M. Thomasson wrote about my new algorithm: >Sorry, but you already lost to RCU. Big time. That atomic >RMR and associated nasty memory barrier simply destroys >performance when compared to RCU read-side overhead. >I am not sure that you actually understand RCU fully. Chriss M Thomasson, i think you don't understand correclty my new algorithm , cause this "lock add" inside the RLock() of the reader side is run only by the group of threads belonging to the same core, cause RLock() called from the reader side belong to a distributed algorithm, so it's very very cheap, it is why my new algorithm scales very well. Thank you, Amine Moulay Ramdane.
[toc] | [next] | [standalone]
| From | Ramine <ramine@1.1> |
|---|---|
| Date | 2014-12-04 20:07 -0800 |
| Message-ID | <m5r0ek$qu8$3@dont-email.me> |
| In reply to | #4970 |
Look inside the source code, RLock() called from the reader side belong to the DRWLOCK library that is a distributed reader-writer mutex, this is why it's very very cheap and this is why it scales very very well... Please look inside my algorithm's source code again to understand it better by downloading it from: https://sites.google.com/site/aminer68/scalable-distributed-sequential-lock Thank you, Amine Moulay Ramdane.
[toc] | [prev] | [standalone]
Back to top | Article view | comp.programming
csiph-web