Re: [Boost-users] write starvation of upgradable lock

Subject: Re: [Boost-users] write starvation of upgradable lock
From: Howard Hinnant (howard.hinnant_at_[hidden])
Date: 2015-02-08 19:57:56

On Feb 8, 2015, at 6:38 PM, David Frank <david_frank56_at_[hidden]> wrote:

> From this discussion,
> 
> http://stackoverflow.com/questions/21773618/starvation-with-upgrade-lock?noredirect=1#comment32949054_21773618
> 
> There seems to be a starvation of writer with upgradable lock, I'm wondering if there is any fix/improvement with later release, e.g, 1.56, or 1.57

More info:  The fair Terekhov algorithm is trivially adaptable to upgrade_mutex as shown in this paper from 2007:

http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2406.html#upgrade_mutex_imp

This code is in the public domain.  Please take it.

Howard