9 Feb
2015
9 Feb
'15
12:57 a.m.
On Feb 8, 2015, at 6:38 PM, David Frank
From this discussion,
http://stackoverflow.com/questions/21773618/starvation-with-upgrade-lock?nor...
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_m... This code is in the public domain. Please take it. Howard