I have code that uses a rwlock, a mutex, a condition, and an atomic variable
to provide something approaching fairness (on W2K, I haven't gotten around
to testing this on Linux yet). I can post it if anyone is interested.
mma
> -----Original Message-----
> From: Marc M. Adkins [mailto:mmadki@Doorways.org]
> Sent: Thursday, June 12, 2003 4:30 PM
> To: dev@apr.apache.org
> Subject: read/write lockout
>
>
> On W2K, read/write locks can result in writer starvation. If there are a
> lot of readers a writer may never get a chance to lock at all.
> I'm assuming
> that 'fairness' in this sense is simply not guaranteed by APR. I was
> wondering if anyone else had run up against this and how they solved it.
>
> mma
>
>
|