From: Peter Dimov (pdimov_at_[hidden])
Date: 2005-10-06 05:38:26
Anthony Williams wrote:
> "Peter Dimov" <pdimov_at_[hidden]> writes:
>> I have produced a read/write mutex implementation as a side effect,
>> available at
>> that is lock-free when there is no contention (i.e. when a reader
>> attempts a lock and no writers are active, or when a writer attempts
>> a lock and the lock is free.)
>> It appears to work (famous last words.) If you see any subtle
>> problems or can stress test it on a multiprocessor, please let me
> This implementation either starves writers or starves readers.
> Running your test code lets the writers all do some work, then the
> readers take over until they're all finished, then the writers
> alternate until they're all done.
Contented readers and all writers compete on the same mutex (mx_); I believe
that this makes the implementation as fair as an ordinary mutex.
If you run my test with all yields removed, you'll see that all threads
finish more or less at the same time, approximately in the order in which
they were started.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk