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


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

More about speed and scalability...

Started byaminer <aminer@toto.net>
First post2014-04-13 21:04 -0700
Last post2014-04-13 23:01 -0700
Articles 2 — 1 participant

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


Contents

  More about speed and scalability... aminer <aminer@toto.net> - 2014-04-13 21:04 -0700
    Re: More about speed and scalability... aminer <aminer@toto.net> - 2014-04-13 23:01 -0700

#2156 — More about speed and scalability...

Fromaminer <aminer@toto.net>
Date2014-04-13 21:04 -0700
SubjectMore about speed and scalability...
Message-ID<lifc58$768$1@news.albasani.net>
Hello,


I have come to another subject, you have seen me on
this forums inventing scalable RWLocks and scalable FIFO fair locks,
and speaking about waitfree and lockfree FIFO queues.. and i was
thinking more and saying to myself what is the very important
think to know when designing such scalable algorithms? i think
the very important think to know about those algorithms is there speed
and scalability, but when you you want to optimize those algorithms for 
speed you have to concentrate on cache-lines transfers, you have to 
reduce cache-lines transfers between caches and that's the very 
important think to do to speed your synchronization algorithms or
concurrent FIFO queues algorithms, and the other very important think to 
know is how to achieve scalability with those algorithms? it's the same 
answer, you have to eliminate cache-lines transfers between caches this 
is how you can achieve scalability, so from know on you have to look at 
those synchronization algorithms and concurrent FIFO queues algorithms 
from the cache-lines transfers point of view to judge or to achieve 
speed and scalability.


Thank you,
Amine Moulay Ramdane.







[toc] | [next] | [standalone]


#2163

Fromaminer <aminer@toto.net>
Date2014-04-13 23:01 -0700
Message-ID<lifj0n$i9g$3@news.albasani.net>
In reply to#2156
On 4/13/2014 9:04 PM, aminer wrote:
>
> Hello,
>
>
> I have come to another subject, you have seen me on
> this forums inventing scalable RWLocks and scalable FIFO fair locks,
> and speaking about waitfree and lockfree FIFO queues.. and i was
> thinking more and saying to myself what is the very important
> think to know when designing such scalable algorithms? i think
> the very important think to know about those algorithms is there speed


i mean the very important "thing" to know, not think...

> and scalability, but when you you want to optimize those algorithms for
> speed you have to concentrate on cache-lines transfers, you have to
> reduce cache-lines transfers between caches and that's the very
> important think to do to speed your synchronization algorithms or
> concurrent FIFO queues algorithms, and the other very important think to
> know is how to achieve scalability with those algorithms? it's the same
> answer, you have to eliminate cache-lines transfers between caches this
> is how you can achieve scalability, so from know on you have to look at
> those synchronization algorithms and concurrent FIFO queues algorithms
> from the cache-lines transfers point of view to judge or to achieve
> speed and scalability.
>
>
> Thank you,
> Amine Moulay Ramdane.
>
>
>
>
>
>
>
>

[toc] | [prev] | [standalone]


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


csiph-web