Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #3961
| Path | csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!us.feeder.erje.net!feeder.erje.net!eu.feeder.erje.net!news.albasani.net!.POSTED!not-for-mail |
|---|---|
| From | aminer <aminer@toto.net> |
| Newsgroups | comp.programming.threads, comp.programming |
| Subject | Scalable FIFO queues... |
| Date | Mon, 21 Oct 2013 17:56:11 -0700 |
| Organization | albasani.net |
| Lines | 50 |
| Message-ID | <l447tk$gi7$1@news.albasani.net> (permalink) |
| Mime-Version | 1.0 |
| Content-Type | text/plain; charset=ISO-8859-1; format=flowed |
| Content-Transfer-Encoding | 7bit |
| X-Trace | news.albasani.net ZykNNw6rpBvYPW2F9vXQ2Vv/IogTdiwPylB+afsR7r7Gexd3+inkKbGt/6okBB+rLDSoLpn0wJPLXB3SUw4vBO838yGauC5xhF/CExiAimoZ8xtdp1KkiyadaTURc0mQ |
| NNTP-Posting-Date | Mon, 21 Oct 2013 21:56:04 +0000 (UTC) |
| Injection-Info | news.albasani.net; logging-data="kes1gNcfpVOUbBD4+QZhrecs/yx9xicAM5/t5dY14F1Zu3363+a5RwPjL6jGFnmwAxN1wEXmUhhmyFGvUq2C1t+5D4WMIlJP1G7IhxtlRh/ZI0axQvy1/2StnvNVefDk"; mail-complaints-to="abuse@albasani.net" |
| User-Agent | Mozilla/5.0 (Windows NT 6.0; WOW64; rv:24.0) Gecko/20100101 Thunderbird/24.0.1 |
| Cancel-Lock | sha1:20CZuAHmZvQdigC4zO1am3g8Bjc= |
| Xref | csiph.com comp.programming.threads:1947 comp.programming:3961 |
Cross-posted to 2 groups.
Show key headers only | View raw
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.
Back to comp.programming | Previous | Next | Find similar | Unroll thread
Scalable FIFO queues... aminer <aminer@toto.net> - 2013-10-21 17:56 -0700
csiph-web