Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #4946
| From | Ramine <ramine@1.1> |
|---|---|
| Newsgroups | comp.programming |
| Subject | My explanation of my algorithm |
| Date | 2014-11-21 14:25 -0800 |
| Organization | A noiseless patient Spider |
| Message-ID | <m4o3fr$e21$1@dont-email.me> (permalink) |
Hello, Here is the explanation of my new algorithm, this very fast concurrent FIFO queue is starvation-free and FIFO fair on the push() side and lockfree on the pop() side, it has given the same performance as the Chriss Thomasson concurrent FIFO queue that uses the backery algorithm, my new algorithm has scored 13 millions of pop() transactions per second and 10.0 millions of push() transaction per second on my 2.4 GHz Quadcore, , i have used it to implement also a very fast concurrent prioority FIFO queue that you will find on the same zipfile. Here is my new explanation of my algorithm: http://pages.videotron.com/aminer/CQueue1.htm Thank you, Amine Moulay Ramdane.
Back to comp.programming | Previous | Next | Find similar | Unroll thread
My explanation of my algorithm Ramine <ramine@1.1> - 2014-11-21 14:25 -0800
csiph-web