Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #1909
| From | aminer <aminer@toto.net> |
|---|---|
| Newsgroups | comp.programming.threads, comp.programming |
| Subject | A Waitfree FIFO queue is coming... |
| Date | 2013-10-11 17:01 -0700 |
| Organization | albasani.net |
| Message-ID | <l39ouu$5t6$1@news.albasani.net> (permalink) |
Cross-posted to 2 groups.
Hello, We have to be smart please, i was thinking about those lockfree FIFO queues, and reading some research papers on internet but i was not satisfied , as i told you lockfree algorithms are bad cause they don't minimize efficiently the cache-coherence traffic , and they are not FIFO fair , so they are not startvation-free, so i was thinking and thinking more and i think i have invented a waitfree bounded FIFO queue algorithm, it's waitfree on the push() and waitfree on the pop() and it satisfy the FIFO fairness and it minimizes efficiently the cache-coherence traffic, now i have my new algorithm on my mind , i will write it on a paper and code it as soon as possible, and i will show you that my new algorithm is very promising and good. Thank you, Amine Moulay Ramdane.
Back to comp.programming.threads | Previous | Next | Find similar | Unroll thread
A Waitfree FIFO queue is coming... aminer <aminer@toto.net> - 2013-10-11 17:01 -0700
csiph-web