Original Post
I've recently been adding lock-free data structures to my programming class library. Lock-free stack, queue, linked list, deque, set, hash table, and load/store with reserve (for arbitrary variable sizes, including those larger than 1 word), based on the hazard pointer algorithms developed by Maged Michael. However, of these, only the last one has a wait-free version, which I suppose could be used to make wait-free versions of the rest of them, although it'd be pretty inefficient. I was wondering if anybody knew of efficient algorithms for wait-free structures like the ones mentioned above. EDIT: Updated that post to correct the definition of wait-free structures. [Edited by - Catafriggm on April 13, 2006 4:19:22 PM]
