So it is my understanding that to read both the reader Wernerlock (or more specifically ReaderWriterLockSlim), both need to read and write Lock a Mute X. I would like to optimize the reading reach of the lock, such that if no one is left unpiled, no lock will be required. (And I'm ready to abandon the writing performance, read some obstacles, read slow and second fast, etc. And, if necessary, read as fast as possible.) So, how will it, or better than that, whether there is a framework or "standard" implementation can one point me? (Or if I have been misunderstood and it is already supported, great!) So for my piece: It appears that if someone has a counter for the number of readers / writers (The increase protected by the interlock), it would be enough to read whether the author's count was non-zero, and only got the lock (and increment within the acquired lock). Writers always get increment, lock, reader count goes up to 0 (readers are always ready to accep...