READ-COPY UPDATE: USING EXECUTION HISTORY TO SOLVE CONCURRENCY PROBLEMS

By P. McKenney, Jack Slingwine. 2002

337 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

IX: A Protected Dataplane Operating System for High Throughput and Low Latency (2014, background): “For example, the ARP table is shared by all elastic threads and is protected by RCU locks [41].”
Hazard pointers: safe memory reclamation for lock-free objects (2004, background): “3)Methods that depend on aggregate reference counters or per-thread timestamps [13], [4], [5].”
High performance dynamic lock-free hash tables and list-based sets (2002, background): “They are either blocking or depend on special operating system support [15, 5].”
Flat combining and the synchronization-parallelism tradeoff (2010, methodology): “entire MetaTrieHT can substantially compromise performance of the ﬁrst two groups of operations that perform readonly access on the MetaTrieHT. To address this issue, we employ the QSBR RCU mechanism [30, 44] to enable lock-free access on MetaTrieHT for its readers (the ﬁrst two groups of operations”
Transactional Memory, 2nd edition (2010, background): “This kind of problem is also one of the central issues addressed by RCU [217].”