Sometimes, we encounter a situation where: “many reads, very few writes.” For example, configuration, status information, coordinate parameters, etc. If all threads use <span>std::mutex</span>, then read operations will queue up, wasting performance, which is unfortunate 😅 To solve this problem, C++17 introduced a smarter lock 🔒: “std::shared_mutex”. Why is it called a Read-Write Lock? You … Read more
The previous article introduced a read-write lock implementation scheme where writers are not starved by readers who come later, ensuring fairness for writers competing for the lock with readers. This article introduces a special type of read-write spinlock that guarantees the highest priority for write operations. Specifically, when there is only one writer, meaning there … Read more
Click the blue text above to follow us. In Linux, a Read-Write Lock provides a synchronization mechanism that allows multiple threads to read shared resources concurrently, but only one thread can perform write operations on that resource. Compared to mutexes or spinlocks, read-write locks offer higher concurrency because they have three states: read-locked state, write-locked … Read more