Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version

Yet another implementation of a lock-free circular array queue

, 27 Apr 2011 BSD
A circular array based lock-free queue with no memory allocation on the heap and no ABA problem

Revisions


  

Compare Revision Minor Date Status Editor
5 - publicly available No 27-Apr-11 8:35 Available Faustino Frechilla
2 No 4-Feb-11 14:29 Composing Faustino Frechilla
1 No 4-Feb-11 14:27 Composing Faustino Frechilla

License

This article, along with any associated source code and files, is licensed under The BSD License

Share

About the Author

Faustino Frechilla
Software Developer
Spain Spain
I am a software engineer who enjoys facing computer performance challenges and solving them through multi-threading and synchronisation.
 
I have always liked the free-software (or open-source for that matter) approach, and how it has been proved to be a way for improving our world and sharing knowledge while it's also possible to make a living out of it.
 
So far I had only tried to release into the free-software community a project about a board game I love: blokus (blockem.sourceforge.net). I've left the profit bit for some other project to come...

| Advertise | Privacy | Terms of Use | Mobile
Web02 | 2.8.141223.1 | Last Updated 27 Apr 2011
Article Copyright 2011 by Faustino Frechilla
Everything else Copyright © CodeProject, 1999-2014
Layout: fixed | fluid