The lock-free nature of the queue enables two thread communication from a single source thread (the Producer) to a single destination thread (the Consumer) without using any locks. The wait-free nature of the queue gives a fixed number of steps for each operation. The wait-free and lock-free circular queue is a useful technique for time and memory sensitive systems. Latest lock-free-wait-free-circularfifo from BitBucket Introduction Lock-Free Single-Producer – Single Consumer Circular Queueĭownload lock-free-wait-free-circularfifo.zip Its’ not yet spell corrected mirror but with nicer formatting can be found here CodeProject: Lock-Free Single Producer The old article is still saved with a nice revision tag but you have to dig to get to it.įor early reviewers here is my own snapshot of the revitalized article. I just finished overwriting my old article. Of all the lock-free structures out there, this got to be the easiest to grasp. Now with C++11 it is a snap to write the wait-free, lock-free simple Single Producer, Single Consumer CircularFifo. Something that could break their shiny code when they least expected it. A double-edged sword to say the least since I liked the feedback but did not like the thought of happy coders using something that was not at all kosher. Of the C++ topics I have written that first article seemed to attract the biggest crowd at CodeProject. Was it broken beyond reason or could it actually work? It was an attempt to understand without recommending the sketchy platform hack. I tried to pick it apart and see what made it tick. In 2009 I wrote about a horrid lock-free Single Producer, Single Consumer Circular Fifo that I had seen in use in the industry. Win up to $18,000 when applying your scripting skills to detect network vulnerabilities. You have until August 31st, 2017 to try out NetMon and participate in LogRhythm’s Network security contest.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |