According to http://en.wikipedia.org/wiki/Non-blocking_synchronization, wait-free algorithms (what you're asking for) are rare in research and in practice, because of the overhead associated with them.
-- /George V. Reilly http://www.georgevreilly.com/blog On 4/13/07, Alex Ivanoff <[EMAIL PROTECTED]> wrote:
I looked at a couple of lock-free collection implementations (Richter's PowerThreading Library, Lock-free LIFO Stack http://msdn.microsoft.com/msdnmag/issues/07/05/CLRInsideOut/default.aspx#S7 , etc.) based on InterlockedCompareExchange. All of them have potential of going into infinite loop in Push/Enqueue/Pop/Dequeue methods. Although the probability is very low it still exists. Has anyone ever thought of/implemented a fix for it? Or am I missing something obvious? Alex
=================================== This list is hosted by DevelopMentor® http://www.develop.com View archives and manage your subscription(s) at http://discuss.develop.com
