Traditional shared locks for synchronizing mostly read-only data are expensive and scale poorly with the number of threads or processor cores. This disclosure describes a scalable, low-cost, low-contention, shared lock (a mutex implementation) that behaves well under cases of reasonable contention and under temporarily write-dominated scenarios. The described shared lock, also known as counting mutex, is based on restartable sequences and fast fences.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
N/A, "Scalable, Highly Performant, Reader/Writer Lock Using Restartable Sequences", Technical Disclosure Commons, (October 29, 2021)