Live briefing
Everything about Read-copy-update
Synchronization mechanism
In computer science, read-copy-update (RCU) is a synchronization mechanism that avoids the use of lock primitives while multiple threads concurrently read and update elements that are linked through pointers and that belong to shared data structures. Wikipedia ā
š§ Start here: a 6-step reading path
- Read the overview: Read-copy-updateA 5-minute orientation
- Pick up a classic book: BibleThe most-reprinted book on the subject
- Read the landmark paper: User-Level Implementations of Read-Copy UpdateCited 118 times
- Go sideways: ABA problemA closely related topic
- Go sideways: Readersāwriter lockA closely related topic
š Definitions
No dictionary entry for this exact phrase.
š Landmark papers (most cited)
User-Level Implementations of Read-Copy Update
The read-copy-update mechanism for supporting real-time applications on shared-memory multiprocessor systems with Linux
Stateless model checking of the Linux kernelās readācopy update (RCU)
Verifying read-copy-update in a logic for weak memory
Visualization of Read-Copy-Update synchronization contexts in C code
TOWARDS A HIGH-LEVEL C++ ABSTRACTION TO UTILIZE THE READ-COPY-UPDATE PATTERN
A Read-Copy Update based parallel server for distributed crowd simulations
š Books worth reading
BibleBible Ā· 1200
Pride and PrejudiceJane Austen Ā· 1813
A Christmas CarolCharles Dickens Ā· 1843
The Picture of Dorian GrayOscar Wilde Ā· 1890
Wuthering HeightsEmily BronteĢ Ā· 1846
HamletWilliam Shakespeare Ā· 1603
The Scarlet LetterNathaniel Hawthorne Ā· 1800
EmmaJane Austen Ā· 1815
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
š Related topics
- ABA problem In multithreaded computing, the ABA problem occurs during synchronization, when a location is read twice, has the same value for both reads, and the readā¦
- Readersāwriter lock In computer science, a readersāwriter (single-writer lock, a multi-reader lock, a push lock, or an MRSW lock) is a synchronization primitive that solvesā¦
- Software lockout In multiprocessor computer systems, software lockout is the issue of performance degradation due to the idle wait times spent by the CPUs in kernel-levelā¦
- Synchronization (computer science) In computer science, synchronization is the task of coordinating multiple processes to join up or handshake at a certain point, in order to reach an agreementā¦
- Compare-and-swap In computer science, compare-and-swap (CAS) is an atomic instruction used in multithreading to achieve synchronization. It compares the contents of a memoryā¦
- Critical section In concurrent programming, concurrent accesses to shared resources can lead to unexpected or erroneous behavior. Thus, the parts of the program where theā¦
- Non-blocking algorithm In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread; forā¦
- Hazard pointer Hazard pointers, in a multithreaded computing environment, are one approach to solving the problems posed by dynamic memory management of the nodes inā¦