Ordered forward lock-free list implemented in C

Question

I need lock-free data structure that confirms to certain criteria: fast, low memory consumption, simple to implement, ordered. Have been searching, and found data structures such as single-linked list, doubly-linked list, skip lists, but none of them meet all my criteria. In my opinion forward list would fulfill those criteria. But I'm not aware of any existent implementation.

Is there any production-ready implementation of forward lock-free list in C for Linux ?

Answer 1

https://code.google.com/p/nbds/

There's a beta implementation of Lock Free Skiplists here. They say it has no known bugs and is feature complete.