I’ve made a particular study of lock-free data structures in the last couple of years. I’ve read most of the papers in the field (there’s only about fourty or so – although only about ten or fifteen are any real use 🙂
AFAIK, a lock-free circular buffer has not been invented. The problem will be dealing with the complex condition where a reader overtakes a writer or vis-versa.
If you have not spent at least six months studying lock-free data structures, do not attempt to write one yourself. You will get it wrong and it may not be obvious to you that errors exist, until your code fails, after deployment, on new platforms.
I believe however there is a solution to your requirement.
You should pair a lock-free queue with a lock-free free-list.
The free-list will give you pre-allocation and so obviate the (fiscally expensive) requirement for a lock-free allocator; when the free-list is empty, you replicate the behaviour of a circular buffer by instantly dequeuing an element from the queue and using that instead.
(Of course, in a lock-based circular buffer, once the lock is obtained, obtaining an element is very quick – basically just a pointer dereference – but you won’t get that in any lock-free algorithm; they often have to go well out of their way to do things; the overhead of failing a free-list pop followed by a dequeue is on a par with the amount of work any lock-free algorithm will need to be doing).
Michael and Scott developed a really good lock-free queue back in 1996. A link below will give you enough details to track down the PDF of their paper; Michael and Scott, FIFO
A lock-free free-list is the simplest lock-free algorithm and in fact I don’t think I’ve seen an actual paper for it.