Scott Carey <scott@richrelevance.com> writes:
> If there is enough lock contention and a common lock case is a short lived shared lock, it makes perfect sense sense.
Fewer readers are blocked waiting on writers at any given time. Readers can 'cut' in line ahead of writers within a
certainscope (only up to the number waiting at the time a shared lock is at the head of the queue). Essentially this
clumpsup shared and exclusive locks into larger streaks, and allows for higher shared lock throughput.
> Exclusive locks may be delayed, but will NOT be starved, since on the next iteration, a streak of exclusive locks
willoccur first in the list and they will all process before any more shared locks can go.
That's a lot of sunny assertions without any shred of evidence behind
them...
The current LWLock behavior was arrived at over multiple iterations and
is not lightly to be toyed with IMHO. Especially not on the basis of
one benchmark that does not reflect mainstream environments.
Note that I'm not saying "no". I'm saying that I want a lot more
evidence *before* we go to the trouble of making this configurable
and asking users to test it.
regards, tom lane
