The readers–writers problem is a common computing problem in concurrency where multiple threads try to access the same shared resource. It involves preventing more than one thread from modifying the shared resource simultaneously, while allowing for two or more readers to access it at the same time. A readers–writer lock is a data structure that solves this problem. It was first formulated and solved by Courtois et al.
UC Berkeley
Fall 2022
This course introduces operating systems design and related concepts. It covers topics like memory allocation, file systems, basic networking, transactions, and security. The course requires foundational knowledge in data structures, assembly language, C programming, and debugging. It aims to improve students' skills in debugging large programs and computational problem solving.
No concepts data
+ 49 more concepts