17 Sep
2005
17 Sep
'05
6:31 p.m.
Sashan Govender schrieb:
Perhaps a lock-free implementation of the STL might be a good idea?
I am afraid that it will be very hard to push it that far. Also I am not sure if I would want that at all. Isn't it the case that lock-free algorithms are much slower in the uncontended case? But having a bag of lockfree algorithms would definitely be a big win. BTW.: As I have stumbled over "lock-free " and "wait-free". Is it true that the use of a user space "spin lock" despite its name belongs to the class of lock-free but not wait free algorithms? Regards, Roland