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


Groups > comp.programming.threads > #2376

Re: Paper about RCU (Read-Copy Update)

From aminer <aminer@toto.net>
Newsgroups comp.programming.threads, comp.programming
Subject Re: Paper about RCU (Read-Copy Update)
Date 2014-05-26 17:14 -0700
Organization albasani.net
Message-ID <lm0aqc$bdf$1@news.albasani.net> (permalink)
References <lm09ba$89v$1@news.albasani.net>

Cross-posted to 2 groups.

Show all headers | View raw


Hello,


As you have noticed i have invented four variants of my scalable RWLock, 
the ones that ends with an X in there names are starvation-free the 
others are not..

Why i have decided to come with scalable and starvation-free RWLocks? 
cause you can have frequent reads and infrequent writes but from time to 
time you can have frequent writes, so i think it is important to have a 
scalable and starvation-free RWLock , this is why i have also come up 
with two variants of scalable and starvation-free RWLocks.

My lightweight variant and starvation-free RWLock called LW_RWLockX and 
also my LW_RWLOCK both scales even at 3% of writes, that's also very 
interresting to know...

And you have to know also that even if we are in a scenario with many 
more writes than 3% of writes and my scalable LW_RWLockX don't scale 
globally in the timing you have to know that LW_RWLockX will still be 
useful , cause even if it doen't scale globally in the timing ,  you 
have to understand that if from the time t1 to the time t2 there is 
writes and reads and from the time t2 to time t3 there is only reads, so 
even if the time from t1 to t2 will add more to the overall time cause 
there is writes threads, the perceived throughput from time t2 to t3 
will be higher and the waiting time from t2 to t3 will be lower cause 
all my RWLocks will be scalable from t2 to t3 and this will make all my 
scalable RWLocks useful cause for example the database clients from 
internet or intranet waiting from t2 to t3 will be served more quickly 
and this is still useful and this will make my scalable RWLocks still 
useful even if it doesn't scale above 3% of writes.

I think that my scalable RWLocks algorithms are scalable
as both quiescent-state based reclamation (QSBR) and RCU (Read-Copy Update)


You can download my scalable RWLocks from:

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



Thank you,
Amine Moulay Ramdane.

Back to comp.programming.threads | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

Paper about RCU (Read-Copy Update) aminer <aminer@toto.net> - 2014-05-26 16:49 -0700
  Re: Paper about RCU (Read-Copy Update) aminer <aminer@toto.net> - 2014-05-26 17:14 -0700
  Re: Paper about RCU (Read-Copy Update) "Chris M. Thomasson" <no@spam.invalid> - 2014-05-29 00:41 -0700
    Re: Paper about RCU (Read-Copy Update) "Chris M. Thomasson" <no@spam.invalid> - 2014-05-29 18:11 -0700

csiph-web