From: Chris Thomasson (cristom_at_[hidden])
Date: 2006-10-24 13:54:15
"Dave Handley" <dave.handley_at_[hidden]> wrote in message
news:41B9816CBF7F0249AEED3F2B4FE1A5A958B8_at_lnpdtdc1.pdt.ms.com...
>> Date: Tue, 24 Oct 2006 09:03:13 -0700
>> From: "Chris Thomasson" <cristom_at_[hidden]>
>> Subject: Re: [boost] A fast-pathed rw-mutex algorithm for Boost...
>> To: boost_at_[hidden]
>> Message-ID: <ehlcp0$3vf$1_at_[hidden]>
[...]
> This can easily be done with atomics and a single 32 bit ref count.
Here is one from Microsoft that uses 32-bit:
http://dotnet.di.unipi.it/Content/sscli/docs/doxygen/clr/vm/rwlock_8cpp.html
http://dotnet.di.unipi.it/Content/sscli/docs/doxygen/clr/vm/rwlock_8h.html
IMHO, it's to complicated when compared to something like my algorithm:
http://groups.google.com/group/comp.programming.threads/msg/816a18f5ea5c3bda