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


Groups > comp.programming.threads > #2489

Re: I was asked a question by Chris Thomasson 1

From aminer <aminer@toto.net>
Newsgroups comp.programming.threads, comp.programming
Subject Re: I was asked a question by Chris Thomasson 1
Date 2014-06-11 05:03 -0700
Organization albasani.net
Message-ID <lnag6l$hm7$2@news.albasani.net> (permalink)
References <lnaflc$gbg$4@news.albasani.net>

Cross-posted to 2 groups.

Show all headers | View raw


On 6/11/2014 4:53 AM, aminer wrote:> Hello,
 >
 >
 > I was asked a question by Chris Thomasson on comp.programming.threads,
 > he asked why i have said that my scalable RWLocks algorithms are as
 > scalable as RCU and quiescent-state based reclamation (QSBR)
 > on the following IEEE paper on read mostly scenarios:
 >
 > Here is the IEEE paper:
 >
 > https://www.efficios.com/pub/rcu/urcu-main.pdf
 >
 >
 > Here is my answer:
 >
 > You have to know that RCU and quiescent-state based reclamation (QSBR)
 > on the above IEEE parpers are scalable on the reader side cause
 > they don't use expensive atomic operations on the reader side, but
 > what i have just explained to you that my scalable RWLocks are also
 > scalable on the reader side, cause they don't use expensive atomic
 > operations on the reader side, in fact my sclable RWLocks algorithms
 > don't generate expensive cache-lines transfers on the reader side,

I must be more precise:

I mean that when there is no writes, my scalable algorithms don't 
generate expensive cache-lines transfers on the reader side, this is why 
my scalable RWLocks algorithms are scalable on read mostly
scenarios.

I have done some empiric statistics with some benchmarks and i have
noticed that my scalable RWLocks scale even at 3% of writes.



Hope you have understood.


 >so
 > this why i have said that on read mostly operations scenarios my
 > scalable RWLocks are as scalable as RCU of the above IEEE paper and as
 > scalable as  quiescent-state based reclamation (QSBR) of the above IEEE
 > paper.
 >
 > I have done some empiric statistics with some benchmarks and i have
 > noticed that my scalable RWLocks scales even at 3% of writes.
 >
 >
 >
 > Thank you,
 > Amine Moulay Ramdane.
 >
 >
 >
 >
 >
 >
 >

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


Thread

I was asked a question by Chris Thomasson 1 aminer <aminer@toto.net> - 2014-06-11 04:54 -0700
  Re: I was asked a question by Chris Thomasson 1 aminer <aminer@toto.net> - 2014-06-11 05:03 -0700
    Re: I was asked a question by Chris Thomasson 1 "Chris M. Thomasson" <no@spam.invalid> - 2014-06-14 11:49 -0700
      Re: I was asked a question by Chris Thomasson 1 Ramine <ramine@1.1> - 2014-06-14 12:37 -0700
      Re: I was asked a question by Chris Thomasson 1 Ramine <ramine@1.1> - 2014-06-14 12:49 -0700

csiph-web