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


Groups > comp.programming.threads > #4513 > unrolled thread

About my "scalable" RWLocks..

Started bySky89 <Sky89@sky68.com>
First post2018-08-02 00:49 -0400
Last post2018-08-02 00:49 -0400
Articles 1 — 1 participant

Back to article view | Back to comp.programming.threads


Contents

  About my "scalable" RWLocks.. Sky89 <Sky89@sky68.com> - 2018-08-02 00:49 -0400

#4513 — About my "scalable" RWLocks..

FromSky89 <Sky89@sky68.com>
Date2018-08-02 00:49 -0400
SubjectAbout my "scalable" RWLocks..
Message-ID<pjtkek$1rh$2@dont-email.me>
Hello..

About my "scalable" RWLocks..

Based on Intel and Micron's claim, 3D Xpoint is 1000x faster than NAND 
and 10x higher density than conventional memory (assume DRAM here). So 
latency of PCIe NAND is about 100us, and 1000x faster 3D Xpoint gives 
100ns, which is 2 times slower than DRAM's speed of 50ns, so this makes 
my scalable RWLocks very useful for 3D Xpoint, so my scalable RWLocks 
are for example very useful for Optane SSD 900P that uses 3D Xpoint and
thus they are very useful for such SSDs that use 3D XPoint and that are 
used in a "scalable" RAID manner.

Read about Intel Optane SSD 900P Review: 3D XPoint Unleashed

https://www.tomshardware.co.uk/intel-optane-ssd-900p-3d-xpoint,review-34076.html

And here is my scalable RWLocks that i have invented, i have also
invented Starvation-free scalable RWLocks, please look at my scalable
RWLocks that i have invented inside my C++ synchronization objects 
library for Windows and Linux here, because it is really powerful:

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

You will find the Delphi and FreePascal versions of my scalable RWLocks
and there source code here:

https://sites.google.com/site/scalable68/


As you have noticed i am an "inventor" of "scalable" algorithms and 
there implementations, i have also invented a fully scalable Threadpool 
that is really powerful  and i have invented  scalable FIFO queues that 
are node-based and array-based  and i have invented a scalable reference 
counting with efficient support for weak references.


So Stay tunned !



Thank you,
Amine Moulay Ramdane.








[toc] | [standalone]


Back to top | Article view | comp.programming.threads


csiph-web