Lines Matching +full:wait +full:- +full:on +full:- +full:read

6 The basic idea behind RCU (read-copy update) is to split destructive
11 since dropped their references.  For example, an RCU-protected deletion
12 from a linked list would first remove the item from the list, wait for
14 information on using RCU with linked lists.
17 --------------------------
19 - Why would anyone want to use RCU?
21   The advantage of RCU's two-part approach is that RCU readers need
23   shared memory, or (on CPUs other than Alpha) execute any memory
25   on modern CPUs is what gives RCU its performance advantages
26   in read-mostly situations.  The fact that RCU readers need not
27   acquire locks can also greatly simplify deadlock-avoidance code.
29 - How can the updater tell when a grace period has completed
33   block, switch to user-mode execution, or enter the idle loop.
36   read-side critical sections.  So, if we remove an item from a
37   linked list, and then wait until all CPUs have switched context,
42   same effect, but require that the readers manipulate CPU-local
44   RCU read-side critical sections.  SRCU also uses CPU-local
45   counters, and permits general blocking within RCU read-side
49 - If I am running on a uniprocessor kernel, which can only do one
50   thing at a time, why should I wait for a grace period?
54 - How can I see where RCU is currently used in the Linux kernel?
64 - What guidelines should I follow when writing code that uses RCU?
68 - Why the name "RCU"?
70   "RCU" stands for "read-copy update".
71   listRCU.rst has more information on where this name came from, search
72   for "read-copy update" to find it.
74 - I hear that RCU is patented?  What is with that?
81   There are now also LGPL implementations of user-level RCU
84 - I hear that RCU needs work in order to support realtime kernels?
86   Realtime-friendly RCU are enabled via the CONFIG_PREEMPTION
89 - Where can I find more information on RCU?