Lines Matching +full:throttle +full:- +full:period +full:- +full:us
4 This document describes RCU-related publications, and is followed by
19 with short-lived threads, such as the K42 research operating system.
20 However, Linux has long-lived tasks, so more is needed.
23 serialization, which is an RCU-like mechanism that relies on the presence
27 that these overheads were not so expensive in the mid-80s. Nonetheless,
28 passive serialization appears to be the first deferred-destruction
30 has lapsed, so this approach may be used in non-GPL software, if desired.
34 In 1987, Rashid et al. described lazy TLB-flush [RichardRashid87a].
36 this paper helped inspire the update-side batching used in the later
38 a description of Argus that noted that use of out-of-date values can
44 in the presence of non-terminating threads. However, this explicit
45 tracking imposes significant read-side overhead, which is undesirable
46 in read-mostly situations. This algorithm does take pains to avoid
47 write-side contention and parallelize the other write-side overheads by
48 providing a fine-grained locking design, however, it would be interesting
55 might use data from iteration $n-1$ or even $n-2$. This introduces
62 is thus inapplicable to most data structures in operating-system kernels.
70 simplest deferred-free technique: simply waiting a fixed amount of time
72 any write-side changes he might have made in this work using SGI's Irix
74 This works well if there is a well-defined upper bound on the length of
76 hard real-time systems. However, if this time is exceeded, perhaps due
77 to preemption, excessive interrupts, or larger-than-anticipated load,
80 operating-system kernels, except when such kernels can provide hard
81 real-time response guarantees for all operations.
84 read-side-tracking to permit replugging of algorithms within a commercial
109 Also in 2002, Michael [Michael02b,Michael02a] presented "hazard-pointer"
111 non-blocking synchronization (wait-free synchronization, lock-free
112 synchronization, and obstruction-free synchronization are all examples of
113 non-blocking synchronization). The corresponding journal article appeared
117 impose significant read-side overhead in the form of memory barriers.
119 [HerlihyLM02]. These techniques can be thought of as inside-out reference
123 of inside-out reference counts is that they can be stored in immortal
129 not necessarily exactly the same as, an RCU grace period. In classic
130 RCU, the reference counter is the per-CPU bit in the "bitmask" field,
132 the corresponding CPU during the prior grace period. Of course, RCU
136 hot-pluggable implementations of operating-system functions [Appavoo03a].
143 2004 has seen a Linux-Journal article on use of RCU in dcache
146 number of operating-system kernels [PaulEdwardMcKenneyPhD], a paper
147 describing how to make RCU safe for soft-realtime applications [Sarma04c],
154 2006 saw the first best-paper award for an RCU paper [ThomasEHart2006a],
156 RCU [PaulEMcKenney2006b], but priority-boosting of RCU read-side critical
158 blocking in read-side critical sections appeared [PaulEMcKenney2006c],
159 Robert Olsson described an RCU-protected trie-hash combination
162 2007 saw the journal version of the award-winning RCU paper from 2006
166 preemptible RCU [PaulEMcKenney2007PreemptibleRCU], and the three-part
170 2008 saw a journal paper on real-time RCU [DinakarGuniguntala2008IBMSysJ],
175 2009 introduced user-level RCU algorithms [PaulEMcKenney2009MaliciousURCU],
179 The problem of resizable RCU-protected hash tables may now be on a path
183 2010 produced a simpler preemptible-RCU implementation
184 based on TREE_RCU [PaulEMcKenney2010SimpleOptRCU], lockdep-RCU
185 [PaulEMcKenney2010LockdepRCU], another resizable RCU-protected hash
188 avoidance in the networking code), realization of the 2009 RCU-protected
193 [LinusTorvalds2011Linux2:6:38:rc1:NPigginVFS], an RCU-protected red-black
196 RCU-protected resizable hash tables [Triplett:2011:RPHash], the 3.0 RCU
202 covering RCU-protected resizable hash tables and the relationship
203 between memory barriers and read-side traversal order: If the updater
204 is making changes in the opposite direction from the read-side traversal
205 order, the updater need only execute a memory-barrier instruction,
207 period between the individual updates [JoshTriplettPhD]. Also in 2012,
208 after seventeen years of attempts, an RCU paper made it into a top-flight
211 user-level RCU to crowd simulation [GuillermoVigueras2012RCUCrowd], and
229 ,pages="354-382"
245 ,number="82-01-01"
253 garbage-collection mechanism to handle concurrent use and deletion
254 of nodes in the tree, but lacks the summary-of-execution-history
255 concept of read-copy locking.
259 -terminated- before allowing this node to be reused. This is
260 not described in great detail -- one could imagine using process
265 systems comprised of long-lived processes. It also produces
270 RCU-like usage that does not rely on an automatic garbage
283 ,pages="439-455"
286 garbage-collection mechanism to handle concurrent use and deletion
287 of nodes in the tree, but lacks the summary-of-execution-history
288 concept of read-copy locking.
292 -terminated- before allowing this node to be reused. This is
293 not described in great detail -- one could imagine using process
298 systems comprised of long-lived processes. It also produces
308 ,Title="Machine-Independent Virtual Memory Management for Paged
315 ,pages="31-39"
318 \url{http://www.cse.ucsc.edu/~randal/221/rashid-machvm.pdf}
322 through a scheduling-clock interrupt before reusing a given range
340 ,issn = {0001-0782}
341 ,pages = {300--312}
349 out of date." Relies on semantics -- approximate numerical
357 ,institution="US Patent and Trademark Office"
360 ,number="US Patent 4,809,168 (lapsed)"
371 ,number="CS-TR-2222.1"
378 Appears to be an independent invention of an RCU-like mechanism.
391 avoid synchronization overhead by using possibly-stale data.
394 invention of RCU-like function -- but this is restricted
408 Wait-free stuff.
416 ,title="Avoid Read-Side Locking Via Delayed Free"
421 Use fixed time delay to approximate grace period. Very simple,
424 Independent invention of RCU-like mechanism.
430 ,Title="Dynamic vnodes -- Design and Implementation"
435 ,pages="11-23"
443 Used a 20-minute time by default, which would most definitely not
446 Apparently independent invention of RCU-like mechanism.
461 ,pages="314-321"
478 ,isbn="0-8186-7395-8"
490 ,institution="US Patent and Trademark Office"
493 ,number="US Patent 5,442,758"
499 Another independent invention of an RCU-like mechanism, but the
508 ,institution="US Patent and Trademark Office"
511 ,number="US Patent 5,608,893"
525 ,institution="US Patent and Trademark Office"
528 ,number="US Patent 5,727,209"
538 ,Title="Read-Copy Update: Using Execution History to Solve Concurrency
543 ,pages="509-518"
547 application to linked list update and log-buffer flushing.
563 ,pages="87-100"
566 Use of RCU-like facility in K42/Tornado. Another independent
568 See especially pages 7-9 (Section 5).
581 \url{http://oss.sgi.com/projects/netdev/archive/2000-06/msg00250.html}
584 Proto-RCU proposal from Phil Rumpf and Rusty Russell.
588 Appeared on net-dev mailing list.
599 \url{http://oss.sgi.com/projects/netdev/archive/2000-06/msg00254.html}
602 Proto-RCU proposal from Phil Rumpf and Rusty Russell.
604 Appeared on net-dev mailing list.
610 ,Title="Read-Copy Update Mutual Exclusion in {Linux}"
626 ,institution="US Patent and Trademark Office"
629 ,number="US Patent 6,219,690"
639 ,Title="Read-Copy Update"
655 ,Title="{RFC:} patch to allow lock-free traversal of lists with insertion"
659 \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=100259266316456&w=2}
662 Memory-barrier and Alpha thread. 100 messages, not too bad...
668 ,Title="Re: {RFC:} patch to allow lock-free traversal of lists with insertion"
672 \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=100264675012867&w=2}
675 Suggested burying memory barriers in Linux's list-manipulation
682 ,Title="{Re:} {[Lse-tech]} {Re:} {RFC:} patch to allow lock-free traversal of lists with insertion"
686 \url{https://lore.kernel.org/r/Pine.LNX.4.33.0110131015410.8707-100000@penguin.transmeta.com}
698 \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=101637107412972&w=2}
704 ,title="High Performance Dynamic Lock-Free Hash Tables and List-Based Sets"
710 ,pages="73-82"
722 ,pages="289-300"
724 Measured scalability of Linux 2.4 kernel's directory-entry cache
732 ,Title="Read-Copy Update"
736 ,pages="338-367"
752 \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=102645767914212&w=2}
765 \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=103082050621241&w=2}
774 ,title="Safe Memory Reclamation for Dynamic Lock-Free Objects Using Atomic
780 ,pages="21-30"
783 currently referencing. Sort of an inside-out garbage collection
785 state its needs. Also requires read-side memory barriers on
792 ,title="Use RCU for System-V IPC"
800 ,title="The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized,
801 Lock-Free Data Structures"
806 ,pages="339-353"
815 \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=103462075416638&w=2}
818 Performance of dcache RCU on kernbench for 16x NUMA-Q and 1x,
829 \url{https://lore.kernel.org/r/3DB86B05.447E7410@us.ibm.com}
842 \url{https://lore.kernel.org/r/Pine.LNX.4.44.0303091831560.2129-100000@home.transmeta.com}
865 ,pages="60-76"
867 Use of RCU to enable hot-swapping for autonomic behavior in K42.
885 ,Title="Using Read-Copy Update Techniques for {System V IPC} in the
892 ,pages="297-310"
895 described System V IPC use of RCU, including order-of-magnitude
911 ,pages="141-154"
922 ,pages="18-26"
927 Reader-friendly intro to RCU, with the infamous old-man-and-brat
945 ,title="Lock-Free Wild Card Search Data Structure and Method"
946 ,institution="US Patent and Trademark Office"
949 ,number="US Patent 6,662,184"
953 Applies RCU to a wildcard-search Patricia tree in order to permit
954 synchronization-free lookup. RCU is used to retain removed nodes
955 for a grace period before freeing them.
967 ,pages="38-46"
997 ,note="\url{http://marc.theaimsgroup.com/?l=linux-kernel&m=108003746402892&w=2}"
999 Head of thread: dipankar/2004.03.23/rcu-low-lat.1.patch
1008 ,note="\url{http://marc.theaimsgroup.com/?l=linux-kernel&m=108016474829546&w=2}"
1010 dipankar/rcuth.2004.03.24/rcu-throttle.patch
1020 \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=108546407726602&w=2}
1023 Hierarchical-bitmap patch for RCU infrastructure.
1029 ,Title="Re: [Lse-tech] [RFC, PATCH] 1/5 rcu lock update:
1030 Add per-cpu batch counter"
1034 \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=108551764515332&w=2}
1037 RCU runs reasonably on a 512-CPU SGI using Manfred Spraul's patches,
1040 https://lore.kernel.org/r/Pine.LNX.4.44.0405222141260.11106-100000@dbl.q-ag.de (cpu_quiet() patch)
1041 https://lore.kernel.org/r/200405250535.i4P5ZJo8017583@dbl.q-ag.de (0/5)
1042 https://lore.kernel.org/r/200405250535.i4P5ZKAQ017591@dbl.q-ag.de (1/5)
1044 https://lore.kernel.org/r/200405250535.i4P5ZLiR017599@dbl.q-ag.de (2/5)
1045 https://lore.kernel.org/r/200405250535.i4P5ZMFt017607@dbl.q-ag.de (3/5)
1046 https://lore.kernel.org/r/200405250535.i4P5ZN6g017615@dbl.q-ag.de (4/5)
1047 https://lore.kernel.org/r/200405250535.i4P5ZO7I017623@dbl.q-ag.de (5/5)
1053 ,Title="Making {RCU} Safe for Deep Sub-Millisecond Response
1060 ,pages="182-191"
1064 …https://www.usenix.org/conference/2004-usenix-annual-technical-conference/making-rcu-safe-deep-sub…
1071 ,title="Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects"
1077 ,pages="491-504"
1079 \url{http://www.research.ibm.com/people/m/michael/ieeetpds-2004.pdf}
1082 New canonical hazard-pointer citation.
1089 An Analysis of Read-Copy-Update Techniques
1096 corresponding to common uses of RCU in several operating-system
1127 receive a scheduling-clock interrupt.
1133 ,Title="Master's Thesis: Applying Lock-free Techniques to the {Linux} Kernel"
1140 Proposes comparing RCU to lock-free methods for the Linux kernel.
1176 \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=109152521410459&w=2}
1189 \url{https://lore.kernel.org/r/20041023202723.GA1930@us.ibm.com}
1198 ,Title="{[PATCH 2/3] SELinux} scalability - convert {AVC} to {RCU}"
1202 ,note="\url{http://marc.theaimsgroup.com/?l=linux-kernel&m=110054979416004&w=2}"
1219 RCU helps SELinux performance. ;-) Made LWN.
1230 \url{http://www.rdrop.com/users/paulmck/RCU/rcu-semantics.2005.01.30a.pdf}
1239 ,Title="Real-Time Preemption and {RCU}"
1244 \url{https://lore.kernel.org/r/20050318002026.GA2693@us.ibm.com}
1254 ,Title="Re: Real-Time Preemption and {RCU}"
1259 \url{https://lore.kernel.org/r/Pine.OSF.4.05.10503181336310.2466-100000@da410.phys.au.dk}
1262 Esben Neilsen suggests read-side suppression of grace-period
1263 processing for crude-but-workable realtime RCU. The downside
1271 ,Title="Efficient Memory Reclamation is Necessary for Fast Lock-Free
1276 \url{ftp://ftp.cs.toronto.edu/csrg-technical-reports/515/}
1279 Comparison of RCU, QBSR, and EBSR. RCU wins for read-mostly
1280 workloads. ;-)
1305 \url{https://lore.kernel.org/r/20050510012444.GA3011@us.ibm.com}
1308 First publication of working lock-based deferred free patches
1344 ,Title="Read-Copy Update {(RCU)}"
1362 Joe Seigh announcing his atomic-ptr-plus project.
1363 http://sourceforge.net/projects/atomic-ptr-plus/
1369 ,Title="Lock-free synchronization primitives"
1374 \url{http://sourceforge.net/projects/atomic-ptr-plus/}
1377 Joe Seigh's atomic-ptr-plus project.
1388 \url{https://lore.kernel.org/r/20050801171137.GA1754@us.ibm.com}
1391 First operating counter-based realtime RCU patch posted to LKML.
1397 ,Title="Re: [Fwd: Re: [patch] Real-Time Preemption, -RT-2.6.13-rc4-V0.7.52-01]"
1402 \url{https://lore.kernel.org/r/20050808144216.GA1307@us.ibm.com}
1405 First operating counter-based realtime RCU patch posted to LKML,
1418 \url{https://lore.kernel.org/r/20051001182056.GA1613@us.ibm.com}
1437 something else always proved superior. Partitioning or RCU. ;-)
1449 ,day="25-29"
1455 Compares QSBR, HPBR, EBR, and lock-free reference counting.
1462 ,Title="[patch 3/3] radix-tree: {RCU} lockless readside"
1470 RCU-protected radix tree.
1481 ,pages="v2 123-138"
1487 Described how to improve the -rt implementation of realtime RCU.
1495 ,Title="Read-Copy Update"
1499 ,note="\url{https://en.wikipedia.org/wiki/Read-copy-update}"
1508 ,Title="A Lockless Pagecache in Linux---Introduction, Progress, Performance"
1512 ,pages="v2 249-254"
1517 Uses RCU-protected radix tree for a lockless page cache.
1539 ,Title="{TRASH}: A dynamic {LC}-trie and hash data structure"
1545 RCU-protected dynamic trie-hash combination.
1552 ,Title="Re: {[-mm PATCH 1/4]} {RCU}: split classic rcu"
1570 Paul McKenney's RCU page showing graphs plotting Linux-kernel
1577 ,Title="Read-Copy Update {(RCU)} Usage in {Linux} Kernel"
1591 ,Title="[PATCH 4/5] lock\_cpu\_hotplug: Redesign - Lightweight implementation of lock\_cpu\_hotplug"
1599 RCU-based reader-writer lock that allows readers to proceed with
1602 the semantics of reader-writer locking. This is a recursive
1619 factor-of-three speedup.
1620 Sped-up version of SRCU at https://lore.kernel.org/r/20061118002845.GF2632@us.ibm.com.
1636 Used to be OlegNesterov2007QRCU, now time-corrected.
1651 Used to be OlegNesterov2007aQRCU, now time-corrected.
1675 ,isbn = {1-59593-577-0}
1682 Uses K42's RCU-like functionality to manage clustered-object
1694 ,issn = {0163-5980}
1695 ,pages = {34--42}
1740 \url{https://lore.kernel.org/r/20070128120509.719287000@programming.kicks-ass.net}
1743 RCU-like implementation for frequent updaters and rare readers(!).
1750 ,Title="Priority-Boosting {RCU} Read-Side Critical Sections"
1773 Patch for QRCU supplying lock-free fast path.
1784 ,issn = {0734-2071}
1785 ,pages = {6/1--6/52}
1796 ,Title="{TRASH}: A dynamic {LC}-trie and hash data structure"
1804 RCU-protected dynamic trie-hash combination.
1816 \url{http://ols.108.redhat.com/2007/Reprints/zijlstra-Reprint.pdf}
1819 Page-cache modifications permitting RCU readers and concurrent
1854 ,Author="Paul E. McKenney and Hans-J. Boehm and Lawrence Crowl"
1855 ,Title="C++ Data-Dependency Ordering: Atomics and Memory Model"
1860 \url{http://open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2664.htm}
1869 ,Title="C++ Data-Dependency Ordering: Function Annotation"
1874 \url{http://open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2782.htm}
1891 Final patch for preemptible RCU to -rt. (Later patches were
1898 ,Title="The design of preemptible read-copy-update"
1917 ,issn="0743-7315"
1918 ,pages="1270--1285"
1923 Compares QSBR, HPBR, EBR, and lock-free reference counting.
1931 ,Title="Re: [patch 1/2] {Linux} Kernel Markers - Support Multiple Probes"
1962 Lays out the three basic components of RCU: (1) publish-subscribe,
1963 (2) wait for pre-existing readers to complete, and (2) maintain
1979 1. RCU is a Reader-Writer Lock Replacement
1980 2. RCU is a Restricted Reference-Counting Mechanism
1981 3. RCU is a Bulk Reference-Counting Mechanism
1998 Gives an overview of the Linux-kernel RCU API and a brief annotated RCU
2020 up dynticks-idle CPUs.
2026 ,Title="Re: [PATCH 02/22 -v7] Add basic support for gcc profiler instrumentation"
2043 ,Booktitle="2008 Linux Developer Symposium - China"
2070 ,title="The read-copy-update mechanism for supporting real-time applications on shared-memory multi…
2076 ,pages="221-236"
2086 ,Title="[{RFC}][{PATCH}] rcu classic: new algorithm for callbacks-processing"
2094 Updated RCU classic algorithm. Introduced multi-tailed list
2107 ,pages="4--17"
2108 ,issn="0163-5980"
2128 State-based RCU. One key thing that this patch does is to
2151 ,title="Efficient Support of Consistent Cyclic Search With Read-Copy Update"
2152 ,institution="US Patent and Trademark Office"
2155 ,number="US Patent 7,426,511"
2173 RCU with combining-tree-based grace-period detection,
2189 Small-footprint implementation of RCU for uniprocessor
2190 embedded applications -- and also for exposition purposes.
2196 ,Title="Using a Malicious User-Level {RCU} to Torture {RCU}-Based Algorithms"
2205 Realtime RCU and torture-testing RCU uses.
2217 Mathieu Desnoyers's user-space RCU implementation.
2218 git://lttng.org/userspace-rcu.git
2219 http://lttng.org/cgi-bin/gitweb.cgi?p=userspace-rcu.git
2256 ,Title="[{PATCH} -tip 0/3] expedited 'big hammer' {RCU} grace periods"
2264 First posting of expedited RCU to be accepted into -tip.
2270 ,Title="[{PATCH} {RFC} -tip 0/4] {RCU} cleanups and simplified preemptable {RCU}"
2295 , title = "Low-Impact Operating System Tracing"
2301 \url{http://www.lttng.org/pub/thesis/desnoyers-dissertation-2009-12.pdf}
2304 Chapter 6 (page 97) covers user-level RCU.
2343 Day-one bug in Tree RCU that took forever to track down.
2356 Mathieu proposed defer_rcu() with fixed-size per-thread pool
2363 ,Title="Multi-Core Systems Modeling for Formal Verification of Parallel Algorithms"
2368 OOMem model for Mathieu's user-level RCU mechanical proof of
2375 ,Title="User-Level Implementations of Read-Copy Update"
2378 ,url={\url{http://www.computer.org/csdl/trans/td/2012/02/ttd2012020375-abs.html}}
2380 RCU overview, desiderata, semi-formal semantics, user-level RCU
2381 usage scenarios, three classes of RCU implementation, wait-free
2382 RCU updates, RCU grace-period batching, update overhead,
2383 http://www.rdrop.com/users/paulmck/RCU/urcu-main-accepted.2011.08.30a.pdf
2384 http://www.rdrop.com/users/paulmck/RCU/urcu-supp-accepted.2011.08.30a.pdf
2394 ,isbn = {978-1-60558-798-1}
2395 ,pages = {381--390}
2423 ,Title="Lockdep-{RCU}"
2440 \url{http://www.mail-archive.com/kvm@vger.kernel.org/msg28640.html}
2457 Use a pair of list_head structures to support RCU-protected
2468 Data-race detector incorporating RCU.
2469 http://www.filesystems.org/docs/abhinav-thesis/abhinav_thesis.pdf
2495 Includes updated software-engineering features.
2502 ,title="Read-Copy-Update for OpenSolaris"
2510 Drives quiescent-state detection from RCU read-side primitives,
2517 ,Title="Linux 2.6.38-rc1"
2521 \url{https://lore.kernel.org/r/AANLkTimajU0x1v6y3rH2+jr-bZ=tNLs1S_agXdGGAa3S@mail.gmail.com}
2524 "The RCU-based name lookup is at the other end of the spectrum - the
2525 absolute anti-gimmick. It's some seriously good stuff, and gets rid of
2529 single-threaded loads (on an SMP kernel), because it gets rid of some
2531 d_lock on every component lookup. So I'm seeing improvements of 30-50%
2532 on some seriously pathname-lookup intensive loads."
2540 ,number = {11-03}
2552 ,pages = {1--6}
2561 ,title="Efficient Support of Consistent Cyclic Search With Read-Copy Update and Parallel Updates"
2562 ,institution="US Patent and Trademark Office"
2565 ,number="US Patent 7,953,778"
2569 Maintains an array of generation numbers to track in-flight
2582 ,pages = {145--158}
2619 ,title = {Redflag: a framework for analysis of Kernel-level concurrency}
2620 …h international conference on Algorithms and architectures for parallel processing - Volume Part I}
2623 ,isbn = {978-3-642-24649-4}
2625 ,pages = {66--79}
2629 ,publisher = {Springer-Verlag}
2639 RCU-protected hash tables, barriers vs. read-side traversal order.
2642 the read-side traversal order, the updater need only execute a
2643 memory-barrier instruction, but if in the same direction, the
2644 updater needs to wait for a grace period between the individual
2651 ,Title="User-Level Implementations of Read-Copy Update"
2655 ,issn="1045-9219"
2656 ,pages="375-382"
2661 RCU overview, desiderata, semi-formal semantics, user-level RCU
2662 usage scenarios, three classes of RCU implementation, wait-free
2663 RCU updates, RCU grace-period batching, update overhead,
2664 http://www.rdrop.com/users/paulmck/RCU/urcu-main-accepted.2011.08.30a.pdf
2665 http://www.rdrop.com/users/paulmck/RCU/urcu-supp-accepted.2011.08.30a.pdf
2676 ,pages = {199--210}
2680 ,url="http://people.csail.mit.edu/nickolai/papers/clements-bonsai.pdf"
2685 ,Title="Making {RCU} Safe For Battery-Powered Devices"
2700 ,doi = {10.1007/s11227-012-0766-x}
2701 ,issn = {0920-8542}
2705 ,posted-at = {2012-05-03 09:12:04}
2707 ,title = {{A Read-Copy Update based parallel server for distributed crowd simulations}}
2708 ,url = {http://dx.doi.org/10.1007/s11227-012-0766-x}
2732 ,note="\url{http://software.imdea.org/~gotsman/papers/recycling-esop13-ext.pdf}"
2734 Separation-logic formulation of RCU uses.
2739 ,Author="Paul E. McKenney and Silas Boyd-Wickizer and Jonathan Walpole"
2747 Overview of the first variant of no-CBs CPUs for RCU.
2759 Overview of the first variant of no-CBs CPUs for RCU.
2765 ,title="Runtime Verification of Kernel-Level Concurrency Using Compiler-Based Instrumentation"
2771 http://www.fsl.cs.sunysb.edu/docs/jseyster-proposal/redflag.pdf
2773 http://www.fsl.cs.sunysb.edu/docs/jseyster-dissertation/redflag.pdf
2778 ,Author="Paul E. McKenney and Silas Boyd-Wickizer and Jonathan Walpole"
2794 ,pages = {249--269}
2798 http://software.imdea.org/~gotsman/papers/recycling-esop13.pdf