Subj : Re: recursive mutexes
To   : comp.programming.threads
From : Markus Elfring
Date : Wed May 18 2005 08:01 pm

> Lock-free shared access is IMO an illusion, usabe for some very small
> and limited cases only, but not for 99.9% of practical requirements.

How "limited" is the application of lock-free algorithms for fundamental data structures
like trees, linked lists or queues?


> And IMO they are also slower than a method which uses locking, even
> if this might sound counter-intuitive.

Would you like to show benchmarks for such differences in execution speed?
(Other papers contain statistics that show the opposite runtime behaviour.)

Regards,
Markus

.