Re: Lock-free reference counting

On Fri, 21 Nov 2008 15:43:03 +0000, Juha Nieminen wrote:

Thus the only place where locking is needed is in the deletion itself,
rather than each time the reference count is modified.

Can anyone see any flaw in this idea?

It very much resembles Leslie Lamport's Bakery algorithm.
Object deletion might still be a problem, though.

(item #11 )