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


Groups > comp.programming > #3961 > unrolled thread

Scalable FIFO queues...

Started byaminer <aminer@toto.net>
First post2013-10-21 17:56 -0700
Last post2013-10-21 17:56 -0700
Articles 1 — 1 participant

Back to article view | Back to comp.programming


Contents

  Scalable FIFO queues... aminer <aminer@toto.net> - 2013-10-21 17:56 -0700

#3961 — Scalable FIFO queues...

Fromaminer <aminer@toto.net>
Date2013-10-21 17:56 -0700
SubjectScalable FIFO queues...
Message-ID<l447tk$gi7$1@news.albasani.net>
Hello,

We have to be smart please , i have come to an interresting subject...

If you look at those scalable FIFO queues...

http://www.google.ca/url?sa=t&rct=j&q=&esrc=s&source=web&cd=5&ved=0CFsQFjAE&url=http%3A%2F%2Fwww.cosy.sbg.ac.at%2Fresearch%2Ftr%2F2012-04_Kirsch_Lippautz_Payer.pdf&ei=FaBlUs-qIbTc4APonIHADQ&usg=AFQjCNHAhL-eCnvuCuNg8MSFhAfkRM73Ng&sig2=uy9PIKocjN9eXPAQQN8QlQ


http://www.google.ca/url?sa=t&rct=j&q=&esrc=s&source=web&cd=6&ved=0CGYQFjAF&url=http%3A%2F%2Fwww.cs.tau.ac.il%2F~shanir%2Fnir-pubs-web%2FPapers%2FSPAA2005.pdf&ei=FaBlUs-qIbTc4APonIHADQ&usg=AFQjCNGxX7ZAmgALfgRyL8WaDKjiYyw2uA&sig2=xAGjnkLOQf5bMhS4I2Wfbg


and this one:

https://www.google.ca/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&ved=0CDgQFjAB&url=https%3A%2F%2Frepository.ist.ac.at%2F124%2F1%2Fmain-spaa2013.pdf&ei=g6BlUqj7MJfi4AOp1oDYCg&usg=AFQjCNH9eKu7ZeXpaoxUhvTk7aW-akWrVg&sig2=lPv-uvllOBClf0xZjBSExA



Researchers will say that those FIFO queues are scalable, but
researchers are only testing pushes() and pops(), they are not testing
the cache misses on the data inside the FIFO queue, i mean we can
not look at the scalability ON MULTICORES from only the viewpoint of 
the FIFO queue algotihms and appllication, because the FIFO queue 
concept is higly interconnected with how the data inside the FIFO queue 
is served in a memory bound manner
and in a cache-unfrienly manner, cause i think that the producers
threads will write the datas on records or objects and push
them on the FIFO queue, and the producers will have to have cache misses
on those datas , and the producers will access the data inside the
FIFO queue in a memory bound manner, so this is why i say that
those FIFO queues above are not scalable in pratice.

Hope you have understood what i mean.



Thank you,
Amine Moulay Ramdane.










[toc] | [standalone]


Back to top | Article view | comp.programming


csiph-web