RTFP.txt 83 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812
  1. Read the Fscking Papers!
  2. This document describes RCU-related publications, and is followed by
  3. the corresponding bibtex entries. A number of the publications may
  4. be found at http://www.rdrop.com/users/paulmck/RCU/. For others, browsers
  5. and search engines will usually find what you are looking for.
  6. The first thing resembling RCU was published in 1980, when Kung and Lehman
  7. [Kung80] recommended use of a garbage collector to defer destruction
  8. of nodes in a parallel binary search tree in order to simplify its
  9. implementation. This works well in environments that have garbage
  10. collectors, but most production garbage collectors incur significant
  11. overhead.
  12. In 1982, Manber and Ladner [Manber82,Manber84] recommended deferring
  13. destruction until all threads running at that time have terminated, again
  14. for a parallel binary search tree. This approach works well in systems
  15. with short-lived threads, such as the K42 research operating system.
  16. However, Linux has long-lived tasks, so more is needed.
  17. In 1986, Hennessy, Osisek, and Seigh [Hennessy89] introduced passive
  18. serialization, which is an RCU-like mechanism that relies on the presence
  19. of "quiescent states" in the VM/XA hypervisor that are guaranteed not
  20. to be referencing the data structure. However, this mechanism was not
  21. optimized for modern computer systems, which is not surprising given
  22. that these overheads were not so expensive in the mid-80s. Nonetheless,
  23. passive serialization appears to be the first deferred-destruction
  24. mechanism to be used in production. Furthermore, the relevant patent
  25. has lapsed, so this approach may be used in non-GPL software, if desired.
  26. (In contrast, implementation of RCU is permitted only in software licensed
  27. under either GPL or LGPL. Sorry!!!)
  28. In 1987, Rashid et al. described lazy TLB-flush [RichardRashid87a].
  29. At first glance, this has nothing to do with RCU, but nevertheless
  30. this paper helped inspire the update-side batching used in the later
  31. RCU implementation in DYNIX/ptx. In 1988, Barbara Liskov published
  32. a description of Argus that noted that use of out-of-date values can
  33. be tolerated in some situations. Thus, this paper provides some early
  34. theoretical justification for use of stale data.
  35. In 1990, Pugh [Pugh90] noted that explicitly tracking which threads
  36. were reading a given data structure permitted deferred free to operate
  37. in the presence of non-terminating threads. However, this explicit
  38. tracking imposes significant read-side overhead, which is undesirable
  39. in read-mostly situations. This algorithm does take pains to avoid
  40. write-side contention and parallelize the other write-side overheads by
  41. providing a fine-grained locking design, however, it would be interesting
  42. to see how much of the performance advantage reported in 1990 remains
  43. today.
  44. At about this same time, Andrews [Andrews91textbook] described ``chaotic
  45. relaxation'', where the normal barriers between successive iterations
  46. of convergent numerical algorithms are relaxed, so that iteration $n$
  47. might use data from iteration $n-1$ or even $n-2$. This introduces
  48. error, which typically slows convergence and thus increases the number of
  49. iterations required. However, this increase is sometimes more than made
  50. up for by a reduction in the number of expensive barrier operations,
  51. which are otherwise required to synchronize the threads at the end
  52. of each iteration. Unfortunately, chaotic relaxation requires highly
  53. structured data, such as the matrices used in scientific programs, and
  54. is thus inapplicable to most data structures in operating-system kernels.
  55. In 1992, Henry (now Alexia) Massalin completed a dissertation advising
  56. parallel programmers to defer processing when feasible to simplify
  57. synchronization [HMassalinPhD]. RCU makes extremely heavy use of
  58. this advice.
  59. In 1993, Jacobson [Jacobson93] verbally described what is perhaps the
  60. simplest deferred-free technique: simply waiting a fixed amount of time
  61. before freeing blocks awaiting deferred free. Jacobson did not describe
  62. any write-side changes he might have made in this work using SGI's Irix
  63. kernel. Aju John published a similar technique in 1995 [AjuJohn95].
  64. This works well if there is a well-defined upper bound on the length of
  65. time that reading threads can hold references, as there might well be in
  66. hard real-time systems. However, if this time is exceeded, perhaps due
  67. to preemption, excessive interrupts, or larger-than-anticipated load,
  68. memory corruption can ensue, with no reasonable means of diagnosis.
  69. Jacobson's technique is therefore inappropriate for use in production
  70. operating-system kernels, except when such kernels can provide hard
  71. real-time response guarantees for all operations.
  72. Also in 1995, Pu et al. [Pu95a] applied a technique similar to that of Pugh's
  73. read-side-tracking to permit replugging of algorithms within a commercial
  74. Unix operating system. However, this replugging permitted only a single
  75. reader at a time. The following year, this same group of researchers
  76. extended their technique to allow for multiple readers [Cowan96a].
  77. Their approach requires memory barriers (and thus pipeline stalls),
  78. but reduces memory latency, contention, and locking overheads.
  79. 1995 also saw the first publication of DYNIX/ptx's RCU mechanism
  80. [Slingwine95], which was optimized for modern CPU architectures,
  81. and was successfully applied to a number of situations within the
  82. DYNIX/ptx kernel. The corresponding conference paper appeared in 1998
  83. [McKenney98].
  84. In 1999, the Tornado and K42 groups described their "generations"
  85. mechanism, which is quite similar to RCU [Gamsa99]. These operating
  86. systems made pervasive use of RCU in place of "existence locks", which
  87. greatly simplifies locking hierarchies and helps avoid deadlocks.
  88. The year 2000 saw an email exchange that would likely have
  89. led to yet another independent invention of something like RCU
  90. [RustyRussell2000a,RustyRussell2000b]. Instead, 2001 saw the first
  91. RCU presentation involving Linux [McKenney01a] at OLS. The resulting
  92. abundance of RCU patches was presented the following year [McKenney02a],
  93. and use of RCU in dcache was first described that same year [Linder02a].
  94. Also in 2002, Michael [Michael02b,Michael02a] presented "hazard-pointer"
  95. techniques that defer the destruction of data structures to simplify
  96. non-blocking synchronization (wait-free synchronization, lock-free
  97. synchronization, and obstruction-free synchronization are all examples of
  98. non-blocking synchronization). The corresponding journal article appeared
  99. in 2004 [MagedMichael04a]. This technique eliminates locking, reduces
  100. contention, reduces memory latency for readers, and parallelizes pipeline
  101. stalls and memory latency for writers. However, these techniques still
  102. impose significant read-side overhead in the form of memory barriers.
  103. Researchers at Sun worked along similar lines in the same timeframe
  104. [HerlihyLM02]. These techniques can be thought of as inside-out reference
  105. counts, where the count is represented by the number of hazard pointers
  106. referencing a given data structure rather than the more conventional
  107. counter field within the data structure itself. The key advantage
  108. of inside-out reference counts is that they can be stored in immortal
  109. variables, thus allowing races between access and deletion to be avoided.
  110. By the same token, RCU can be thought of as a "bulk reference count",
  111. where some form of reference counter covers all reference by a given CPU
  112. or thread during a set timeframe. This timeframe is related to, but
  113. not necessarily exactly the same as, an RCU grace period. In classic
  114. RCU, the reference counter is the per-CPU bit in the "bitmask" field,
  115. and each such bit covers all references that might have been made by
  116. the corresponding CPU during the prior grace period. Of course, RCU
  117. can be thought of in other terms as well.
  118. In 2003, the K42 group described how RCU could be used to create
  119. hot-pluggable implementations of operating-system functions [Appavoo03a].
  120. Later that year saw a paper describing an RCU implementation
  121. of System V IPC [Arcangeli03] (following up on a suggestion by
  122. Hugh Dickins [Dickins02a] and an implementation by Mingming Cao
  123. [MingmingCao2002IPCRCU]), and an introduction to RCU in Linux Journal
  124. [McKenney03a].
  125. 2004 has seen a Linux-Journal article on use of RCU in dcache
  126. [McKenney04a], a performance comparison of locking to RCU on several
  127. different CPUs [McKenney04b], a dissertation describing use of RCU in a
  128. number of operating-system kernels [PaulEdwardMcKenneyPhD], a paper
  129. describing how to make RCU safe for soft-realtime applications [Sarma04c],
  130. and a paper describing SELinux performance with RCU [JamesMorris04b].
  131. 2005 brought further adaptation of RCU to realtime use, permitting
  132. preemption of RCU realtime critical sections [PaulMcKenney05a,
  133. PaulMcKenney05b].
  134. 2006 saw the first best-paper award for an RCU paper [ThomasEHart2006a],
  135. as well as further work on efficient implementations of preemptible
  136. RCU [PaulEMcKenney2006b], but priority-boosting of RCU read-side critical
  137. sections proved elusive. An RCU implementation permitting general
  138. blocking in read-side critical sections appeared [PaulEMcKenney2006c],
  139. Robert Olsson described an RCU-protected trie-hash combination
  140. [RobertOlsson2006a].
  141. 2007 saw the journal version of the award-winning RCU paper from 2006
  142. [ThomasEHart2007a], as well as a paper demonstrating use of Promela
  143. and Spin to mechanically verify an optimization to Oleg Nesterov's
  144. QRCU [PaulEMcKenney2007QRCUspin], a design document describing
  145. preemptible RCU [PaulEMcKenney2007PreemptibleRCU], and the three-part
  146. LWN "What is RCU?" series [PaulEMcKenney2007WhatIsRCUFundamentally,
  147. PaulEMcKenney2008WhatIsRCUUsage, and PaulEMcKenney2008WhatIsRCUAPI].
  148. 2008 saw a journal paper on real-time RCU [DinakarGuniguntala2008IBMSysJ],
  149. a history of how Linux changed RCU more than RCU changed Linux
  150. [PaulEMcKenney2008RCUOSR], and a design overview of hierarchical RCU
  151. [PaulEMcKenney2008HierarchicalRCU].
  152. 2009 introduced user-level RCU algorithms [PaulEMcKenney2009MaliciousURCU],
  153. which Mathieu Desnoyers is now maintaining [MathieuDesnoyers2009URCU]
  154. [MathieuDesnoyersPhD]. TINY_RCU [PaulEMcKenney2009BloatWatchRCU] made
  155. its appearance, as did expedited RCU [PaulEMcKenney2009expeditedRCU].
  156. The problem of resizable RCU-protected hash tables may now be on a path
  157. to a solution [JoshTriplett2009RPHash]. A few academic researchers are now
  158. using RCU to solve their parallel problems [HariKannan2009DynamicAnalysisRCU].
  159. 2010 produced a simpler preemptible-RCU implementation
  160. based on TREE_RCU [PaulEMcKenney2010SimpleOptRCU], lockdep-RCU
  161. [PaulEMcKenney2010LockdepRCU], another resizable RCU-protected hash
  162. table [HerbertXu2010RCUResizeHash] (this one consuming more memory,
  163. but allowing arbitrary changes in hash function, as required for DoS
  164. avoidance in the networking code), realization of the 2009 RCU-protected
  165. hash table with atomic node move [JoshTriplett2010RPHash], an update on
  166. the RCU API [PaulEMcKenney2010RCUAPI].
  167. 2011 marked the inclusion of Nick Piggin's fully lockless dentry search
  168. [LinusTorvalds2011Linux2:6:38:rc1:NPigginVFS], an RCU-protected red-black
  169. tree using software transactional memory to protect concurrent updates
  170. (strange, but true!) [PhilHoward2011RCUTMRBTree], yet another variant of
  171. RCU-protected resizable hash tables [Triplett:2011:RPHash], the 3.0 RCU
  172. trainwreck [PaulEMcKenney2011RCU3.0trainwreck], and Neil Brown's "Meet the
  173. Lockers" LWN article [NeilBrown2011MeetTheLockers]. Some academic
  174. work looked at debugging uses of RCU [Seyster:2011:RFA:2075416.2075425].
  175. In 2012, Josh Triplett received his Ph.D. with his dissertation
  176. covering RCU-protected resizable hash tables and the relationship
  177. between memory barriers and read-side traversal order: If the updater
  178. is making changes in the opposite direction from the read-side traveral
  179. order, the updater need only execute a memory-barrier instruction,
  180. but if in the same direction, the updater needs to wait for a grace
  181. period between the individual updates [JoshTriplettPhD]. Also in 2012,
  182. after seventeen years of attempts, an RCU paper made it into a top-flight
  183. academic journal, IEEE Transactions on Parallel and Distributed Systems
  184. [MathieuDesnoyers2012URCU]. A group of researchers in Spain applied
  185. user-level RCU to crowd simulation [GuillermoVigueras2012RCUCrowd], and
  186. another group of researchers in Europe produced a formal description of
  187. RCU based on separation logic [AlexeyGotsman2012VerifyGraceExtended],
  188. which was published in the 2013 European Symposium on Programming
  189. [AlexeyGotsman2013ESOPRCU].
  190. Bibtex Entries
  191. @article{Kung80
  192. ,author="H. T. Kung and Q. Lehman"
  193. ,title="Concurrent Manipulation of Binary Search Trees"
  194. ,Year="1980"
  195. ,Month="September"
  196. ,journal="ACM Transactions on Database Systems"
  197. ,volume="5"
  198. ,number="3"
  199. ,pages="354-382"
  200. ,annotation={
  201. Use garbage collector to clean up data after everyone is done with it.
  202. .
  203. Oldest use of something vaguely resembling RCU that I have found.
  204. http://portal.acm.org/citation.cfm?id=320619&dl=GUIDE,
  205. [Viewed December 3, 2007]
  206. }
  207. }
  208. @techreport{Manber82
  209. ,author="Udi Manber and Richard E. Ladner"
  210. ,title="Concurrency Control in a Dynamic Search Structure"
  211. ,institution="Department of Computer Science, University of Washington"
  212. ,address="Seattle, Washington"
  213. ,year="1982"
  214. ,number="82-01-01"
  215. ,month="January"
  216. ,pages="28"
  217. ,annotation={
  218. .
  219. Superseded by Manber84.
  220. .
  221. Describes concurrent AVL tree implementation. Uses a
  222. garbage-collection mechanism to handle concurrent use and deletion
  223. of nodes in the tree, but lacks the summary-of-execution-history
  224. concept of read-copy locking.
  225. .
  226. Keeps full list of processes that were active when a given
  227. node was to be deleted, and waits until all such processes have
  228. -terminated- before allowing this node to be reused. This is
  229. not described in great detail -- one could imagine using process
  230. IDs for this if the ID space was large enough that overlapping
  231. never occurred.
  232. .
  233. This restriction makes this algorithm unsuitable for use in
  234. systems comprised of long-lived processes. It also produces
  235. completely unacceptable overhead in systems with large numbers
  236. of processes. Finally, it is specific to AVL trees.
  237. .
  238. Cites Kung80, so not an independent invention, but the first
  239. RCU-like usage that does not rely on an automatic garbage
  240. collector.
  241. }
  242. }
  243. @article{Manber84
  244. ,author="Udi Manber and Richard E. Ladner"
  245. ,title="Concurrency Control in a Dynamic Search Structure"
  246. ,Year="1984"
  247. ,Month="September"
  248. ,journal="ACM Transactions on Database Systems"
  249. ,volume="9"
  250. ,number="3"
  251. ,pages="439-455"
  252. ,annotation={
  253. Describes concurrent AVL tree implementation. Uses a
  254. garbage-collection mechanism to handle concurrent use and deletion
  255. of nodes in the tree, but lacks the summary-of-execution-history
  256. concept of read-copy locking.
  257. .
  258. Keeps full list of processes that were active when a given
  259. node was to be deleted, and waits until all such processes have
  260. -terminated- before allowing this node to be reused. This is
  261. not described in great detail -- one could imagine using process
  262. IDs for this if the ID space was large enough that overlapping
  263. never occurred.
  264. .
  265. This restriction makes this algorithm unsuitable for use in
  266. systems comprised of long-lived processes. It also produces
  267. completely unacceptable overhead in systems with large numbers
  268. of processes. Finally, it is specific to AVL trees.
  269. }
  270. }
  271. @Conference{RichardRashid87a
  272. ,Author="Richard Rashid and Avadis Tevanian and Michael Young and
  273. David Golub and Robert Baron and David Black and William Bolosky and
  274. Jonathan Chew"
  275. ,Title="Machine-Independent Virtual Memory Management for Paged
  276. Uniprocessor and Multiprocessor Architectures"
  277. ,Booktitle="{2\textsuperscript{nd} Symposium on Architectural Support
  278. for Programming Languages and Operating Systems}"
  279. ,Publisher="Association for Computing Machinery"
  280. ,Month="October"
  281. ,Year="1987"
  282. ,pages="31-39"
  283. ,Address="Palo Alto, CA"
  284. ,note="Available:
  285. \url{http://www.cse.ucsc.edu/~randal/221/rashid-machvm.pdf}
  286. [Viewed February 17, 2005]"
  287. ,annotation={
  288. Describes lazy TLB flush, where one waits for each CPU to pass
  289. through a scheduling-clock interrupt before reusing a given range
  290. of virtual address. Does not describe how one determines that
  291. all CPUs have in fact taken such an interrupt, though there are
  292. no shortage of straightforward methods for accomplishing this.
  293. .
  294. Note that it does not make sense to just wait a fixed amount of
  295. time, since a given CPU might have interrupts disabled for an
  296. extended amount of time.
  297. }
  298. }
  299. @article{BarbaraLiskov1988ArgusCACM
  300. ,author = {Barbara Liskov}
  301. ,title = {Distributed programming in {Argus}}
  302. ,journal = {Commun. ACM}
  303. ,volume = {31}
  304. ,number = {3}
  305. ,year = {1988}
  306. ,issn = {0001-0782}
  307. ,pages = {300--312}
  308. ,doi = {http://doi.acm.org/10.1145/42392.42399}
  309. ,publisher = {ACM}
  310. ,address = {New York, NY, USA}
  311. ,annotation={
  312. At the top of page 307: "Conflicts with deposits and withdrawals
  313. are necessary if the reported total is to be up to date. They
  314. could be avoided by having total return a sum that is slightly
  315. out of date." Relies on semantics -- approximate numerical
  316. values sometimes OK.
  317. }
  318. }
  319. @techreport{Hennessy89
  320. ,author="James P. Hennessy and Damian L. Osisek and Joseph W. {Seigh II}"
  321. ,title="Passive Serialization in a Multitasking Environment"
  322. ,institution="US Patent and Trademark Office"
  323. ,address="Washington, DC"
  324. ,year="1989"
  325. ,number="US Patent 4,809,168 (lapsed)"
  326. ,month="February"
  327. ,pages="11"
  328. }
  329. @techreport{Pugh90
  330. ,author="William Pugh"
  331. ,title="Concurrent Maintenance of Skip Lists"
  332. ,institution="Institute of Advanced Computer Science Studies, Department of Computer Science, University of Maryland"
  333. ,address="College Park, Maryland"
  334. ,year="1990"
  335. ,number="CS-TR-2222.1"
  336. ,month="June"
  337. ,annotation={
  338. Concurrent access to skip lists. Has both weak and strong search.
  339. Uses concept of ``garbage queue'', but has no real way of cleaning
  340. the garbage efficiently.
  341. .
  342. Appears to be an independent invention of an RCU-like mechanism.
  343. }
  344. }
  345. # Was Adams91, see also syncrefs.bib.
  346. @Book{Andrews91textbook
  347. ,Author="Gregory R. Andrews"
  348. ,title="Concurrent Programming, Principles, and Practices"
  349. ,Publisher="Benjamin Cummins"
  350. ,Year="1991"
  351. ,annotation={
  352. Has a few paragraphs describing ``chaotic relaxation'', a
  353. numerical analysis technique that allows multiprocessors to
  354. avoid synchronization overhead by using possibly-stale data.
  355. .
  356. Seems like this is descended from yet another independent
  357. invention of RCU-like function -- but this is restricted
  358. in that reclamation is not necessary.
  359. }
  360. }
  361. @phdthesis{HMassalinPhD
  362. ,author="H. Massalin"
  363. ,title="Synthesis: An Efficient Implementation of Fundamental Operating
  364. System Services"
  365. ,school="Columbia University"
  366. ,address="New York, NY"
  367. ,year="1992"
  368. ,annotation={
  369. Mondo optimizing compiler.
  370. Wait-free stuff.
  371. Good advice: defer work to avoid synchronization. See page 90
  372. (PDF page 106), Section 5.4, fourth bullet point.
  373. }
  374. }
  375. @unpublished{Jacobson93
  376. ,author="Van Jacobson"
  377. ,title="Avoid Read-Side Locking Via Delayed Free"
  378. ,year="1993"
  379. ,month="September"
  380. ,note="private communication"
  381. ,annotation={
  382. Use fixed time delay to approximate grace period. Very simple,
  383. but subject to random memory corruption under heavy load.
  384. .
  385. Independent invention of RCU-like mechanism.
  386. }
  387. }
  388. @Conference{AjuJohn95
  389. ,Author="Aju John"
  390. ,Title="Dynamic vnodes -- Design and Implementation"
  391. ,Booktitle="{USENIX Winter 1995}"
  392. ,Publisher="USENIX Association"
  393. ,Month="January"
  394. ,Year="1995"
  395. ,pages="11-23"
  396. ,Address="New Orleans, LA"
  397. ,note="Available:
  398. \url{https://www.usenix.org/publications/library/proceedings/neworl/full_papers/john.a}
  399. [Viewed October 1, 2010]"
  400. ,annotation={
  401. Age vnodes out of the cache, and have a fixed time set by a kernel
  402. parameter. Not clear that all races were in fact correctly handled.
  403. Used a 20-minute time by default, which would most definitely not
  404. be suitable during DoS attacks or virus scans.
  405. .
  406. Apparently independent invention of RCU-like mechanism.
  407. }
  408. }
  409. @conference{Pu95a
  410. ,Author = "Calton Pu and Tito Autrey and Andrew Black and Charles Consel and
  411. Crispin Cowan and Jon Inouye and Lakshmi Kethana and Jonathan Walpole and
  412. Ke Zhang"
  413. ,Title = "Optimistic Incremental Specialization: Streamlining a Commercial
  414. ,Operating System"
  415. ,Booktitle = "15\textsuperscript{th} ACM Symposium on
  416. ,Operating Systems Principles (SOSP'95)"
  417. ,address = "Copper Mountain, CO"
  418. ,month="December"
  419. ,year="1995"
  420. ,pages="314-321"
  421. ,annotation={
  422. Uses a replugger, but with a flag to signal when people are
  423. using the resource at hand. Only one reader at a time.
  424. }
  425. }
  426. @conference{Cowan96a
  427. ,Author = "Crispin Cowan and Tito Autrey and Charles Krasic and
  428. ,Calton Pu and Jonathan Walpole"
  429. ,Title = "Fast Concurrent Dynamic Linking for an Adaptive Operating System"
  430. ,Booktitle = "International Conference on Configurable Distributed Systems
  431. (ICCDS'96)"
  432. ,address = "Annapolis, MD"
  433. ,month="May"
  434. ,year="1996"
  435. ,pages="108"
  436. ,isbn="0-8186-7395-8"
  437. ,annotation={
  438. Uses a replugger, but with a counter to signal when people are
  439. using the resource at hand. Allows multiple readers.
  440. }
  441. }
  442. @techreport{Slingwine95
  443. ,author="John D. Slingwine and Paul E. McKenney"
  444. ,title="Apparatus and Method for Achieving Reduced Overhead Mutual
  445. Exclusion and Maintaining Coherency in a Multiprocessor System
  446. Utilizing Execution History and Thread Monitoring"
  447. ,institution="US Patent and Trademark Office"
  448. ,address="Washington, DC"
  449. ,year="1995"
  450. ,number="US Patent 5,442,758"
  451. ,month="August"
  452. ,annotation={
  453. Describes the parallel RCU infrastructure. Includes NUMA aspect
  454. (structure of bitmap can reflect bus structure of computer system).
  455. .
  456. Another independent invention of an RCU-like mechanism, but the
  457. "real" RCU this time!
  458. }
  459. }
  460. @techreport{Slingwine97
  461. ,author="John D. Slingwine and Paul E. McKenney"
  462. ,title="Method for Maintaining Data Coherency Using Thread Activity
  463. Summaries in a Multicomputer System"
  464. ,institution="US Patent and Trademark Office"
  465. ,address="Washington, DC"
  466. ,year="1997"
  467. ,number="US Patent 5,608,893"
  468. ,month="March"
  469. ,pages="19"
  470. ,annotation={
  471. Describes use of RCU to synchronize data between a pair of
  472. SMP/NUMA computer systems.
  473. }
  474. }
  475. @techreport{Slingwine98
  476. ,author="John D. Slingwine and Paul E. McKenney"
  477. ,title="Apparatus and Method for Achieving Reduced Overhead Mutual
  478. Exclusion and Maintaining Coherency in a Multiprocessor System
  479. Utilizing Execution History and Thread Monitoring"
  480. ,institution="US Patent and Trademark Office"
  481. ,address="Washington, DC"
  482. ,year="1998"
  483. ,number="US Patent 5,727,209"
  484. ,month="March"
  485. ,annotation={
  486. Describes doing an atomic update by copying the data item and
  487. then substituting it into the data structure.
  488. }
  489. }
  490. @Conference{McKenney98
  491. ,Author="Paul E. McKenney and John D. Slingwine"
  492. ,Title="Read-Copy Update: Using Execution History to Solve Concurrency
  493. Problems"
  494. ,Booktitle="{Parallel and Distributed Computing and Systems}"
  495. ,Month="October"
  496. ,Year="1998"
  497. ,pages="509-518"
  498. ,Address="Las Vegas, NV"
  499. ,annotation={
  500. Describes and analyzes RCU mechanism in DYNIX/ptx. Describes
  501. application to linked list update and log-buffer flushing.
  502. Defines 'quiescent state'. Includes both measured and analytic
  503. evaluation.
  504. http://www.rdrop.com/users/paulmck/RCU/rclockpdcsproof.pdf
  505. [Viewed December 3, 2007]
  506. }
  507. }
  508. @Conference{Gamsa99
  509. ,Author="Ben Gamsa and Orran Krieger and Jonathan Appavoo and Michael Stumm"
  510. ,Title="Tornado: Maximizing Locality and Concurrency in a Shared Memory
  511. Multiprocessor Operating System"
  512. ,Booktitle="{Proceedings of the 3\textsuperscript{rd} Symposium on
  513. Operating System Design and Implementation}"
  514. ,Month="February"
  515. ,Year="1999"
  516. ,pages="87-100"
  517. ,Address="New Orleans, LA"
  518. ,annotation={
  519. Use of RCU-like facility in K42/Tornado. Another independent
  520. invention of RCU.
  521. See especially pages 7-9 (Section 5).
  522. http://www.usenix.org/events/osdi99/full_papers/gamsa/gamsa.pdf
  523. [Viewed August 30, 2006]
  524. }
  525. }
  526. @unpublished{RustyRussell2000a
  527. ,Author="Rusty Russell"
  528. ,Title="Re: modular net drivers"
  529. ,month="June"
  530. ,year="2000"
  531. ,day="23"
  532. ,note="Available:
  533. \url{http://oss.sgi.com/projects/netdev/archive/2000-06/msg00250.html}
  534. [Viewed April 10, 2006]"
  535. ,annotation={
  536. Proto-RCU proposal from Phil Rumpf and Rusty Russell.
  537. Yet another independent invention of RCU.
  538. Outline of algorithm to unload modules...
  539. .
  540. Appeared on net-dev mailing list.
  541. }
  542. }
  543. @unpublished{RustyRussell2000b
  544. ,Author="Rusty Russell"
  545. ,Title="Re: modular net drivers"
  546. ,month="June"
  547. ,year="2000"
  548. ,day="24"
  549. ,note="Available:
  550. \url{http://oss.sgi.com/projects/netdev/archive/2000-06/msg00254.html}
  551. [Viewed April 10, 2006]"
  552. ,annotation={
  553. Proto-RCU proposal from Phil Rumpf and Rusty Russell.
  554. .
  555. Appeared on net-dev mailing list.
  556. }
  557. }
  558. @unpublished{McKenney01b
  559. ,Author="Paul E. McKenney and Dipankar Sarma"
  560. ,Title="Read-Copy Update Mutual Exclusion in {Linux}"
  561. ,month="February"
  562. ,year="2001"
  563. ,note="Available:
  564. \url{http://lse.sourceforge.net/locking/rcu/rcupdate_doc.html}
  565. [Viewed October 18, 2004]"
  566. ,annotation={
  567. Prototypical Linux documentation for RCU.
  568. }
  569. }
  570. @techreport{Slingwine01
  571. ,author="John D. Slingwine and Paul E. McKenney"
  572. ,title="Apparatus and Method for Achieving Reduced Overhead Mutual
  573. Exclusion and Maintaining Coherency in a Multiprocessor System
  574. Utilizing Execution History and Thread Monitoring"
  575. ,institution="US Patent and Trademark Office"
  576. ,address="Washington, DC"
  577. ,year="2001"
  578. ,number="US Patent 6,219,690"
  579. ,month="April"
  580. ,annotation={
  581. 'Change in mode' aspect of RCU. Can be thought of as a lazy barrier.
  582. }
  583. }
  584. @Conference{McKenney01a
  585. ,Author="Paul E. McKenney and Jonathan Appavoo and Andi Kleen and
  586. Orran Krieger and Rusty Russell and Dipankar Sarma and Maneesh Soni"
  587. ,Title="Read-Copy Update"
  588. ,Booktitle="{Ottawa Linux Symposium}"
  589. ,Month="July"
  590. ,Year="2001"
  591. ,note="Available:
  592. \url{http://www.linuxsymposium.org/2001/abstracts/readcopy.php}
  593. \url{http://www.rdrop.com/users/paulmck/RCU/rclock_OLS.2001.05.01c.pdf}
  594. [Viewed June 23, 2004]"
  595. ,annotation={
  596. Described RCU, and presented some patches implementing and using
  597. it in the Linux kernel.
  598. }
  599. }
  600. @unpublished{McKenney01f
  601. ,Author="Paul E. McKenney"
  602. ,Title="{RFC:} patch to allow lock-free traversal of lists with insertion"
  603. ,month="October"
  604. ,year="2001"
  605. ,note="Available:
  606. \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=100259266316456&w=2}
  607. [Viewed June 23, 2004]"
  608. ,annotation={
  609. Memory-barrier and Alpha thread. 100 messages, not too bad...
  610. }
  611. }
  612. @unpublished{Spraul01
  613. ,Author="Manfred Spraul"
  614. ,Title="Re: {RFC:} patch to allow lock-free traversal of lists with insertion"
  615. ,month="October"
  616. ,year="2001"
  617. ,note="Available:
  618. \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=100264675012867&w=2}
  619. [Viewed June 23, 2004]"
  620. ,annotation={
  621. Suggested burying memory barriers in Linux's list-manipulation
  622. primitives.
  623. }
  624. }
  625. @unpublished{LinusTorvalds2001a
  626. ,Author="Linus Torvalds"
  627. ,Title="{Re:} {[Lse-tech]} {Re:} {RFC:} patch to allow lock-free traversal of lists with insertion"
  628. ,month="October"
  629. ,year="2001"
  630. ,note="Available:
  631. \url{http://lkml.org/lkml/2001/10/13/105}
  632. [Viewed August 21, 2004]"
  633. ,annotation={
  634. }
  635. }
  636. @unpublished{Blanchard02a
  637. ,Author="Anton Blanchard"
  638. ,Title="some RCU dcache and ratcache results"
  639. ,month="March"
  640. ,year="2002"
  641. ,note="Available:
  642. \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=101637107412972&w=2}
  643. [Viewed October 18, 2004]"
  644. }
  645. @conference{Michael02b
  646. ,author="Maged M. Michael"
  647. ,title="High Performance Dynamic Lock-Free Hash Tables and List-Based Sets"
  648. ,Year="2002"
  649. ,Month="August"
  650. ,booktitle="{Proceedings of the 14\textsuperscript{th} Annual ACM
  651. Symposium on Parallel
  652. Algorithms and Architecture}"
  653. ,pages="73-82"
  654. ,annotation={
  655. Like the title says...
  656. }
  657. }
  658. @Conference{Linder02a
  659. ,Author="Hanna Linder and Dipankar Sarma and Maneesh Soni"
  660. ,Title="Scalability of the Directory Entry Cache"
  661. ,Booktitle="{Ottawa Linux Symposium}"
  662. ,Month="June"
  663. ,Year="2002"
  664. ,pages="289-300"
  665. ,annotation={
  666. Measured scalability of Linux 2.4 kernel's directory-entry cache
  667. (dcache), and measured some scalability enhancements.
  668. }
  669. }
  670. @Conference{McKenney02a
  671. ,Author="Paul E. McKenney and Dipankar Sarma and
  672. Andrea Arcangeli and Andi Kleen and Orran Krieger and Rusty Russell"
  673. ,Title="Read-Copy Update"
  674. ,Booktitle="{Ottawa Linux Symposium}"
  675. ,Month="June"
  676. ,Year="2002"
  677. ,pages="338-367"
  678. ,note="Available:
  679. \url{http://www.linux.org.uk/~ajh/ols2002_proceedings.pdf.gz}
  680. [Viewed June 23, 2004]"
  681. ,annotation={
  682. Presented and compared a number of RCU implementations for the
  683. Linux kernel.
  684. }
  685. }
  686. @unpublished{Sarma02a
  687. ,Author="Dipankar Sarma"
  688. ,Title="specweb99: dcache scalability results"
  689. ,month="July"
  690. ,year="2002"
  691. ,note="Available:
  692. \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=102645767914212&w=2}
  693. [Viewed June 23, 2004]"
  694. ,annotation={
  695. Compare fastwalk and RCU for dcache. RCU won.
  696. }
  697. }
  698. @unpublished{Barbieri02
  699. ,Author="Luca Barbieri"
  700. ,Title="Re: {[PATCH]} Initial support for struct {vfs\_cred}"
  701. ,month="August"
  702. ,year="2002"
  703. ,note="Available:
  704. \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=103082050621241&w=2}
  705. [Viewed: June 23, 2004]"
  706. ,annotation={
  707. Suggested RCU for vfs\_shared\_cred.
  708. }
  709. }
  710. @conference{Michael02a
  711. ,author="Maged M. Michael"
  712. ,title="Safe Memory Reclamation for Dynamic Lock-Free Objects Using Atomic
  713. Reads and Writes"
  714. ,Year="2002"
  715. ,Month="August"
  716. ,booktitle="{Proceedings of the 21\textsuperscript{st} Annual ACM
  717. Symposium on Principles of Distributed Computing}"
  718. ,pages="21-30"
  719. ,annotation={
  720. Each thread keeps an array of pointers to items that it is
  721. currently referencing. Sort of an inside-out garbage collection
  722. mechanism, but one that requires the accessing code to explicitly
  723. state its needs. Also requires read-side memory barriers on
  724. most architectures.
  725. }
  726. }
  727. @unpublished{Dickins02a
  728. ,author="Hugh Dickins"
  729. ,title="Use RCU for System-V IPC"
  730. ,year="2002"
  731. ,month="October"
  732. ,note="private communication"
  733. }
  734. @InProceedings{HerlihyLM02
  735. ,author={Maurice Herlihy and Victor Luchangco and Mark Moir}
  736. ,title="The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized,
  737. Lock-Free Data Structures"
  738. ,booktitle={Proceedings of 16\textsuperscript{th} International
  739. Symposium on Distributed Computing}
  740. ,year=2002
  741. ,month="October"
  742. ,pages="339-353"
  743. }
  744. @unpublished{Sarma02b
  745. ,Author="Dipankar Sarma"
  746. ,Title="Some dcache\_rcu benchmark numbers"
  747. ,month="October"
  748. ,year="2002"
  749. ,note="Available:
  750. \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=103462075416638&w=2}
  751. [Viewed June 23, 2004]"
  752. ,annotation={
  753. Performance of dcache RCU on kernbench for 16x NUMA-Q and 1x,
  754. 2x, and 4x systems. RCU does no harm, and helps on 16x.
  755. }
  756. }
  757. @unpublished{MingmingCao2002IPCRCU
  758. ,Author="Mingming Cao"
  759. ,Title="[PATCH]updated ipc lock patch"
  760. ,month="October"
  761. ,year="2002"
  762. ,note="Available:
  763. \url{https://lkml.org/lkml/2002/10/24/262}
  764. [Viewed February 15, 2014]"
  765. ,annotation={
  766. Mingming Cao's patch to introduce RCU to SysV IPC.
  767. }
  768. }
  769. @unpublished{LinusTorvalds2003a
  770. ,Author="Linus Torvalds"
  771. ,Title="Re: {[PATCH]} small fixes in brlock.h"
  772. ,month="March"
  773. ,year="2003"
  774. ,note="Available:
  775. \url{http://lkml.org/lkml/2003/3/9/205}
  776. [Viewed March 13, 2006]"
  777. ,annotation={
  778. Linus suggests replacing brlock with RCU and/or seqlocks:
  779. .
  780. 'It's entirely possible that the current user could be replaced
  781. by RCU and/or seqlocks, and we could get rid of brlocks entirely.'
  782. .
  783. Steve Hemminger responds by replacing them with RCU.
  784. }
  785. }
  786. @article{Appavoo03a
  787. ,author="J. Appavoo and K. Hui and C. A. N. Soules and R. W. Wisniewski and
  788. D. M. {Da Silva} and O. Krieger and M. A. Auslander and D. J. Edelsohn and
  789. B. Gamsa and G. R. Ganger and P. McKenney and M. Ostrowski and
  790. B. Rosenburg and M. Stumm and J. Xenidis"
  791. ,title="Enabling Autonomic Behavior in Systems Software With Hot Swapping"
  792. ,Year="2003"
  793. ,Month="January"
  794. ,journal="IBM Systems Journal"
  795. ,volume="42"
  796. ,number="1"
  797. ,pages="60-76"
  798. ,annotation={
  799. Use of RCU to enable hot-swapping for autonomic behavior in K42.
  800. }
  801. }
  802. @unpublished{Seigh03
  803. ,author="Joseph W. {Seigh II}"
  804. ,title="Read Copy Update"
  805. ,Year="2003"
  806. ,Month="March"
  807. ,note="email correspondence"
  808. ,annotation={
  809. Described the relationship of the VM/XA passive serialization to RCU.
  810. }
  811. }
  812. @Conference{Arcangeli03
  813. ,Author="Andrea Arcangeli and Mingming Cao and Paul E. McKenney and
  814. Dipankar Sarma"
  815. ,Title="Using Read-Copy Update Techniques for {System V IPC} in the
  816. {Linux} 2.5 Kernel"
  817. ,Booktitle="Proceedings of the 2003 USENIX Annual Technical Conference
  818. (FREENIX Track)"
  819. ,Publisher="USENIX Association"
  820. ,year="2003"
  821. ,month="June"
  822. ,pages="297-310"
  823. ,annotation={
  824. Compared updated RCU implementations for the Linux kernel, and
  825. described System V IPC use of RCU, including order-of-magnitude
  826. performance improvements.
  827. http://www.rdrop.com/users/paulmck/RCU/rcu.FREENIX.2003.06.14.pdf
  828. }
  829. }
  830. @Conference{Soules03a
  831. ,Author="Craig A. N. Soules and Jonathan Appavoo and Kevin Hui and
  832. Dilma {Da Silva} and Gregory R. Ganger and Orran Krieger and
  833. Michael Stumm and Robert W. Wisniewski and Marc Auslander and
  834. Michal Ostrowski and Bryan Rosenburg and Jimi Xenidis"
  835. ,Title="System Support for Online Reconfiguration"
  836. ,Booktitle="Proceedings of the 2003 USENIX Annual Technical Conference"
  837. ,Publisher="USENIX Association"
  838. ,year="2003"
  839. ,month="June"
  840. ,pages="141-154"
  841. }
  842. @article{McKenney03a
  843. ,author="Paul E. McKenney"
  844. ,title="Using {RCU} in the {Linux} 2.5 Kernel"
  845. ,Year="2003"
  846. ,Month="October"
  847. ,journal="Linux Journal"
  848. ,volume="1"
  849. ,number="114"
  850. ,pages="18-26"
  851. ,note="Available:
  852. \url{http://www.linuxjournal.com/article/6993}
  853. [Viewed November 14, 2007]"
  854. ,annotation={
  855. Reader-friendly intro to RCU, with the infamous old-man-and-brat
  856. cartoon.
  857. }
  858. }
  859. @unpublished{Sarma03a
  860. ,Author="Dipankar Sarma"
  861. ,Title="RCU low latency patches"
  862. ,month="December"
  863. ,year="2003"
  864. ,note="Message ID: 20031222180114.GA2248@in.ibm.com"
  865. ,annotation={
  866. dipankar/ct.2004.03.27/RCUll.2003.12.22.patch
  867. }
  868. }
  869. @techreport{Friedberg03a
  870. ,author="Stuart A. Friedberg"
  871. ,title="Lock-Free Wild Card Search Data Structure and Method"
  872. ,institution="US Patent and Trademark Office"
  873. ,address="Washington, DC"
  874. ,year="2003"
  875. ,number="US Patent 6,662,184"
  876. ,month="December"
  877. ,pages="112"
  878. ,annotation={
  879. Applies RCU to a wildcard-search Patricia tree in order to permit
  880. synchronization-free lookup. RCU is used to retain removed nodes
  881. for a grace period before freeing them.
  882. }
  883. }
  884. @article{McKenney04a
  885. ,author="Paul E. McKenney and Dipankar Sarma and Maneesh Soni"
  886. ,title="Scaling dcache with {RCU}"
  887. ,Year="2004"
  888. ,Month="January"
  889. ,journal="Linux Journal"
  890. ,volume="1"
  891. ,number="118"
  892. ,pages="38-46"
  893. ,annotation={
  894. Reader friendly intro to dcache and RCU.
  895. http://www.linuxjournal.com/node/7124
  896. [Viewed December 26, 2010]
  897. }
  898. }
  899. @Conference{McKenney04b
  900. ,Author="Paul E. McKenney"
  901. ,Title="{RCU} vs. Locking Performance on Different {CPUs}"
  902. ,Booktitle="{linux.conf.au}"
  903. ,Month="January"
  904. ,Year="2004"
  905. ,Address="Adelaide, Australia"
  906. ,note="Available:
  907. \url{http://www.linux.org.au/conf/2004/abstracts.html#90}
  908. \url{http://www.rdrop.com/users/paulmck/RCU/lockperf.2004.01.17a.pdf}
  909. [Viewed June 23, 2004]"
  910. ,annotation={
  911. Compares performance of RCU to that of other locking primitives
  912. over a number of CPUs (x86, Opteron, Itanium, and PPC).
  913. }
  914. }
  915. @unpublished{Sarma04a
  916. ,Author="Dipankar Sarma"
  917. ,Title="{[PATCH]} {RCU} for low latency (experimental)"
  918. ,month="March"
  919. ,year="2004"
  920. ,note="\url{http://marc.theaimsgroup.com/?l=linux-kernel&m=108003746402892&w=2}"
  921. ,annotation={
  922. Head of thread: dipankar/2004.03.23/rcu-low-lat.1.patch
  923. }
  924. }
  925. @unpublished{Sarma04b
  926. ,Author="Dipankar Sarma"
  927. ,Title="Re: {[PATCH]} {RCU} for low latency (experimental)"
  928. ,month="March"
  929. ,year="2004"
  930. ,note="\url{http://marc.theaimsgroup.com/?l=linux-kernel&m=108016474829546&w=2}"
  931. ,annotation={
  932. dipankar/rcuth.2004.03.24/rcu-throttle.patch
  933. }
  934. }
  935. @unpublished{Spraul04a
  936. ,Author="Manfred Spraul"
  937. ,Title="[RFC] 0/5 rcu lock update"
  938. ,month="May"
  939. ,year="2004"
  940. ,note="Available:
  941. \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=108546407726602&w=2}
  942. [Viewed June 23, 2004]"
  943. ,annotation={
  944. Hierarchical-bitmap patch for RCU infrastructure.
  945. }
  946. }
  947. @unpublished{Steiner04a
  948. ,Author="Jack Steiner"
  949. ,Title="Re: [Lse-tech] [RFC, PATCH] 1/5 rcu lock update:
  950. Add per-cpu batch counter"
  951. ,month="May"
  952. ,year="2004"
  953. ,note="Available:
  954. \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=108551764515332&w=2}
  955. [Viewed June 23, 2004]"
  956. ,annotation={
  957. RCU runs reasonably on a 512-CPU SGI using Manfred Spraul's patches,
  958. which may be found at:
  959. https://lkml.org/lkml/2004/5/20/49 (split vars into cachelines)
  960. https://lkml.org/lkml/2004/5/22/114 (cpu_quiet() patch)
  961. https://lkml.org/lkml/2004/5/25/24 (0/5)
  962. https://lkml.org/lkml/2004/5/25/23 (1/5)
  963. https://lkml.org/lkml/2004/5/25/265 (works for Jack)
  964. https://lkml.org/lkml/2004/5/25/20 (2/5)
  965. https://lkml.org/lkml/2004/5/25/22 (3/5)
  966. https://lkml.org/lkml/2004/5/25/19 (4/5)
  967. https://lkml.org/lkml/2004/5/25/21 (5/5)
  968. }
  969. }
  970. @Conference{Sarma04c
  971. ,Author="Dipankar Sarma and Paul E. McKenney"
  972. ,Title="Making {RCU} Safe for Deep Sub-Millisecond Response
  973. Realtime Applications"
  974. ,Booktitle="Proceedings of the 2004 USENIX Annual Technical Conference
  975. (FREENIX Track)"
  976. ,Publisher="USENIX Association"
  977. ,year="2004"
  978. ,month="June"
  979. ,pages="182-191"
  980. ,annotation={
  981. Describes and compares a number of modifications to the Linux RCU
  982. implementation that make it friendly to realtime applications.
  983. https://www.usenix.org/conference/2004-usenix-annual-technical-conference/making-rcu-safe-deep-sub-millisecond-response
  984. [Viewed July 26, 2012]
  985. }
  986. }
  987. @article{MagedMichael04a
  988. ,author="Maged M. Michael"
  989. ,title="Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects"
  990. ,Year="2004"
  991. ,Month="June"
  992. ,journal="IEEE Transactions on Parallel and Distributed Systems"
  993. ,volume="15"
  994. ,number="6"
  995. ,pages="491-504"
  996. ,url="Available:
  997. \url{http://www.research.ibm.com/people/m/michael/ieeetpds-2004.pdf}
  998. [Viewed March 1, 2005]"
  999. ,annotation={
  1000. New canonical hazard-pointer citation.
  1001. }
  1002. }
  1003. @phdthesis{PaulEdwardMcKenneyPhD
  1004. ,author="Paul E. McKenney"
  1005. ,title="Exploiting Deferred Destruction:
  1006. An Analysis of Read-Copy-Update Techniques
  1007. in Operating System Kernels"
  1008. ,school="OGI School of Science and Engineering at
  1009. Oregon Health and Sciences University"
  1010. ,year="2004"
  1011. ,annotation={
  1012. Describes RCU implementations and presents design patterns
  1013. corresponding to common uses of RCU in several operating-system
  1014. kernels.
  1015. http://www.rdrop.com/users/paulmck/RCU/RCUdissertation.2004.07.14e1.pdf
  1016. [Viewed October 15, 2004]
  1017. }
  1018. }
  1019. @unpublished{PaulEMcKenney2004rcu:dereference
  1020. ,Author="Dipankar Sarma"
  1021. ,Title="{Re: RCU : Abstracted RCU dereferencing [5/5]}"
  1022. ,month="August"
  1023. ,year="2004"
  1024. ,note="Available:
  1025. \url{http://lkml.org/lkml/2004/8/6/237}
  1026. [Viewed June 8, 2010]"
  1027. ,annotation={
  1028. Introduce rcu_dereference().
  1029. }
  1030. }
  1031. @unpublished{JimHouston04a
  1032. ,Author="Jim Houston"
  1033. ,Title="{[RFC\&PATCH] Alternative {RCU} implementation}"
  1034. ,month="August"
  1035. ,year="2004"
  1036. ,note="Available:
  1037. \url{http://lkml.org/lkml/2004/8/30/87}
  1038. [Viewed February 17, 2005]"
  1039. ,annotation={
  1040. Uses active code in rcu_read_lock() and rcu_read_unlock() to
  1041. make RCU happen, allowing RCU to function on CPUs that do not
  1042. receive a scheduling-clock interrupt.
  1043. }
  1044. }
  1045. @unpublished{TomHart04a
  1046. ,Author="Thomas E. Hart"
  1047. ,Title="Master's Thesis: Applying Lock-free Techniques to the {Linux} Kernel"
  1048. ,month="October"
  1049. ,year="2004"
  1050. ,note="Available:
  1051. \url{http://www.cs.toronto.edu/~tomhart/masters_thesis.html}
  1052. [Viewed October 15, 2004]"
  1053. ,annotation={
  1054. Proposes comparing RCU to lock-free methods for the Linux kernel.
  1055. }
  1056. }
  1057. @unpublished{Vaddagiri04a
  1058. ,Author="Srivatsa Vaddagiri"
  1059. ,Title="Subject: [RFC] Use RCU for tcp\_ehash lookup"
  1060. ,month="October"
  1061. ,year="2004"
  1062. ,note="Available:
  1063. \url{http://marc.theaimsgroup.com/?t=109395731700004&r=1&w=2}
  1064. [Viewed October 18, 2004]"
  1065. ,annotation={
  1066. Srivatsa's RCU patch for tcp_ehash lookup.
  1067. }
  1068. }
  1069. @unpublished{Thirumalai04a
  1070. ,Author="Ravikiran Thirumalai"
  1071. ,Title="Subject: [patchset] Lockfree fd lookup 0 of 5"
  1072. ,month="October"
  1073. ,year="2004"
  1074. ,note="Available:
  1075. \url{http://marc.theaimsgroup.com/?t=109144217400003&r=1&w=2}
  1076. [Viewed October 18, 2004]"
  1077. ,annotation={
  1078. Ravikiran's lockfree FD patch.
  1079. }
  1080. }
  1081. @unpublished{Thirumalai04b
  1082. ,Author="Ravikiran Thirumalai"
  1083. ,Title="Subject: Re: [patchset] Lockfree fd lookup 0 of 5"
  1084. ,month="October"
  1085. ,year="2004"
  1086. ,note="Available:
  1087. \url{http://marc.theaimsgroup.com/?l=linux-kernel&m=109152521410459&w=2}
  1088. [Viewed October 18, 2004]"
  1089. ,annotation={
  1090. Ravikiran's lockfree FD patch.
  1091. }
  1092. }
  1093. @unpublished{PaulEMcKenney2004rcu:assign:pointer
  1094. ,Author="Paul E. McKenney"
  1095. ,Title="{[PATCH 1/3] RCU: \url{rcu_assign_pointer()} removal of memory barriers}"
  1096. ,month="October"
  1097. ,year="2004"
  1098. ,note="Available:
  1099. \url{http://lkml.org/lkml/2004/10/23/241}
  1100. [Viewed June 8, 2010]"
  1101. ,annotation={
  1102. Introduce rcu_assign_pointer().
  1103. }
  1104. }
  1105. @unpublished{JamesMorris04a
  1106. ,Author="James Morris"
  1107. ,Title="{[PATCH 2/3] SELinux} scalability - convert {AVC} to {RCU}"
  1108. ,day="15"
  1109. ,month="November"
  1110. ,year="2004"
  1111. ,note="\url{http://marc.theaimsgroup.com/?l=linux-kernel&m=110054979416004&w=2}"
  1112. ,annotation={
  1113. James Morris posts Kaigai Kohei's patch to LKML.
  1114. [Viewed December 10, 2004]
  1115. Kaigai's patch is at https://lkml.org/lkml/2004/9/27/52
  1116. }
  1117. }
  1118. @unpublished{JamesMorris04b
  1119. ,Author="James Morris"
  1120. ,Title="Recent Developments in {SELinux} Kernel Performance"
  1121. ,month="December"
  1122. ,year="2004"
  1123. ,note="Available:
  1124. \url{http://www.livejournal.com/users/james_morris/2153.html}
  1125. [Viewed December 10, 2004]"
  1126. ,annotation={
  1127. RCU helps SELinux performance. ;-) Made LWN.
  1128. }
  1129. }
  1130. @unpublished{PaulMcKenney2005RCUSemantics
  1131. ,Author="Paul E. McKenney and Jonathan Walpole"
  1132. ,Title="{RCU} Semantics: A First Attempt"
  1133. ,month="January"
  1134. ,year="2005"
  1135. ,day="30"
  1136. ,note="Available:
  1137. \url{http://www.rdrop.com/users/paulmck/RCU/rcu-semantics.2005.01.30a.pdf}
  1138. [Viewed December 6, 2009]"
  1139. ,annotation={
  1140. Early derivation of RCU semantics.
  1141. }
  1142. }
  1143. @unpublished{PaulMcKenney2005e
  1144. ,Author="Paul E. McKenney"
  1145. ,Title="Real-Time Preemption and {RCU}"
  1146. ,month="March"
  1147. ,year="2005"
  1148. ,day="17"
  1149. ,note="Available:
  1150. \url{http://lkml.org/lkml/2005/3/17/199}
  1151. [Viewed September 5, 2005]"
  1152. ,annotation={
  1153. First posting showing how RCU can be safely adapted for
  1154. preemptable RCU read side critical sections.
  1155. }
  1156. }
  1157. @unpublished{EsbenNeilsen2005a
  1158. ,Author="Esben Neilsen"
  1159. ,Title="Re: Real-Time Preemption and {RCU}"
  1160. ,month="March"
  1161. ,year="2005"
  1162. ,day="18"
  1163. ,note="Available:
  1164. \url{http://lkml.org/lkml/2005/3/18/122}
  1165. [Viewed March 30, 2006]"
  1166. ,annotation={
  1167. Esben Neilsen suggests read-side suppression of grace-period
  1168. processing for crude-but-workable realtime RCU. The downside
  1169. is indefinite grace periods... But this is OK for experimentation
  1170. and testing.
  1171. }
  1172. }
  1173. @unpublished{TomHart05a
  1174. ,Author="Thomas E. Hart and Paul E. McKenney and Angela Demke Brown"
  1175. ,Title="Efficient Memory Reclamation is Necessary for Fast Lock-Free
  1176. Data Structures"
  1177. ,month="March"
  1178. ,year="2005"
  1179. ,note="Available:
  1180. \url{ftp://ftp.cs.toronto.edu/csrg-technical-reports/515/}
  1181. [Viewed March 4, 2005]"
  1182. ,annotation={
  1183. Comparison of RCU, QBSR, and EBSR. RCU wins for read-mostly
  1184. workloads. ;-)
  1185. }
  1186. }
  1187. @unpublished{JonCorbet2005DeprecateSyncKernel
  1188. ,Author="Jonathan Corbet"
  1189. ,Title="API change: synchronize_kernel() deprecated"
  1190. ,month="May"
  1191. ,day="3"
  1192. ,year="2005"
  1193. ,note="Available:
  1194. \url{http://lwn.net/Articles/134484/}
  1195. [Viewed May 3, 2005]"
  1196. ,annotation={
  1197. Jon Corbet describes deprecation of synchronize_kernel()
  1198. in favor of synchronize_rcu() and synchronize_sched().
  1199. }
  1200. }
  1201. @unpublished{PaulMcKenney05a
  1202. ,Author="Paul E. McKenney"
  1203. ,Title="{[RFC]} {RCU} and {CONFIG\_PREEMPT\_RT} progress"
  1204. ,month="May"
  1205. ,year="2005"
  1206. ,note="Available:
  1207. \url{http://lkml.org/lkml/2005/5/9/185}
  1208. [Viewed May 13, 2005]"
  1209. ,annotation={
  1210. First publication of working lock-based deferred free patches
  1211. for the CONFIG_PREEMPT_RT environment.
  1212. }
  1213. }
  1214. @conference{PaulMcKenney05b
  1215. ,Author="Paul E. McKenney and Dipankar Sarma"
  1216. ,Title="Towards Hard Realtime Response from the {Linux} Kernel on {SMP} Hardware"
  1217. ,Booktitle="linux.conf.au 2005"
  1218. ,month="April"
  1219. ,year="2005"
  1220. ,address="Canberra, Australia"
  1221. ,note="Available:
  1222. \url{http://www.rdrop.com/users/paulmck/RCU/realtimeRCU.2005.04.23a.pdf}
  1223. [Viewed May 13, 2005]"
  1224. ,annotation={
  1225. Realtime turns into making RCU yet more realtime friendly.
  1226. http://lca2005.linux.org.au/Papers/Paul%20McKenney/Towards%20Hard%20Realtime%20Response%20from%20the%20Linux%20Kernel/LKS.2005.04.22a.pdf
  1227. }
  1228. }
  1229. @unpublished{PaulEMcKenneyHomePage
  1230. ,Author="Paul E. McKenney"
  1231. ,Title="{Paul} {E.} {McKenney}"
  1232. ,month="May"
  1233. ,year="2005"
  1234. ,note="Available:
  1235. \url{http://www.rdrop.com/users/paulmck/}
  1236. [Viewed May 25, 2005]"
  1237. ,annotation={
  1238. Paul McKenney's home page.
  1239. }
  1240. }
  1241. @unpublished{PaulEMcKenneyRCUPage
  1242. ,Author="Paul E. McKenney"
  1243. ,Title="Read-Copy Update {(RCU)}"
  1244. ,month="May"
  1245. ,year="2005"
  1246. ,note="Available:
  1247. \url{http://www.rdrop.com/users/paulmck/RCU}
  1248. [Viewed May 25, 2005]"
  1249. ,annotation={
  1250. Paul McKenney's RCU page.
  1251. }
  1252. }
  1253. @unpublished{JosephSeigh2005a
  1254. ,Author="Joseph Seigh"
  1255. ,Title="{RCU}+{SMR} (hazard pointers)"
  1256. ,month="July"
  1257. ,year="2005"
  1258. ,note="Personal communication"
  1259. ,annotation={
  1260. Joe Seigh announcing his atomic-ptr-plus project.
  1261. http://sourceforge.net/projects/atomic-ptr-plus/
  1262. }
  1263. }
  1264. @unpublished{JosephSeigh2005b
  1265. ,Author="Joseph Seigh"
  1266. ,Title="Lock-free synchronization primitives"
  1267. ,month="July"
  1268. ,day="6"
  1269. ,year="2005"
  1270. ,note="Available:
  1271. \url{http://sourceforge.net/projects/atomic-ptr-plus/}
  1272. [Viewed August 8, 2005]"
  1273. ,annotation={
  1274. Joe Seigh's atomic-ptr-plus project.
  1275. }
  1276. }
  1277. @unpublished{PaulMcKenney2005c
  1278. ,Author="Paul E.McKenney"
  1279. ,Title="{[RFC,PATCH] RCU} and {CONFIG\_PREEMPT\_RT} sane patch"
  1280. ,month="August"
  1281. ,day="1"
  1282. ,year="2005"
  1283. ,note="Available:
  1284. \url{http://lkml.org/lkml/2005/8/1/155}
  1285. [Viewed March 14, 2006]"
  1286. ,annotation={
  1287. First operating counter-based realtime RCU patch posted to LKML.
  1288. }
  1289. }
  1290. @unpublished{PaulMcKenney2005d
  1291. ,Author="Paul E. McKenney"
  1292. ,Title="Re: [Fwd: Re: [patch] Real-Time Preemption, -RT-2.6.13-rc4-V0.7.52-01]"
  1293. ,month="August"
  1294. ,day="8"
  1295. ,year="2005"
  1296. ,note="Available:
  1297. \url{http://lkml.org/lkml/2005/8/8/108}
  1298. [Viewed March 14, 2006]"
  1299. ,annotation={
  1300. First operating counter-based realtime RCU patch posted to LKML,
  1301. but fixed so that various unusual combinations of configuration
  1302. parameters all function properly.
  1303. }
  1304. }
  1305. @unpublished{PaulMcKenney2005rcutorture
  1306. ,Author="Paul E. McKenney"
  1307. ,Title="{[PATCH]} {RCU} torture testing"
  1308. ,month="October"
  1309. ,day="1"
  1310. ,year="2005"
  1311. ,note="Available:
  1312. \url{http://lkml.org/lkml/2005/10/1/70}
  1313. [Viewed March 14, 2006]"
  1314. ,annotation={
  1315. First rcutorture patch.
  1316. }
  1317. }
  1318. @unpublished{DavidSMiller2006HashedLocking
  1319. ,Author="David S. Miller"
  1320. ,Title="Re: [{PATCH}, {RFC}] {RCU} : {OOM} avoidance and lower latency"
  1321. ,month="January"
  1322. ,day="6"
  1323. ,year="2006"
  1324. ,note="Available:
  1325. \url{https://lkml.org/lkml/2006/1/7/22}
  1326. [Viewed February 29, 2012]"
  1327. ,annotation={
  1328. David Miller's view on hashed arrays of locks: used to really
  1329. like it, but time he saw an opportunity for this technique,
  1330. something else always proved superior. Partitioning or RCU. ;-)
  1331. }
  1332. }
  1333. @conference{ThomasEHart2006a
  1334. ,Author="Thomas E. Hart and Paul E. McKenney and Angela Demke Brown"
  1335. ,Title="Making Lockless Synchronization Fast: Performance Implications
  1336. of Memory Reclamation"
  1337. ,Booktitle="20\textsuperscript{th} {IEEE} International Parallel and
  1338. Distributed Processing Symposium"
  1339. ,month="April"
  1340. ,year="2006"
  1341. ,day="25-29"
  1342. ,address="Rhodes, Greece"
  1343. ,note="Available:
  1344. \url{http://www.rdrop.com/users/paulmck/RCU/hart_ipdps06.pdf}
  1345. [Viewed April 28, 2008]"
  1346. ,annotation={
  1347. Compares QSBR, HPBR, EBR, and lock-free reference counting.
  1348. http://www.cs.toronto.edu/~tomhart/perflab/ipdps06.tgz
  1349. }
  1350. }
  1351. @unpublished{NickPiggin2006radixtree
  1352. ,Author="Nick Piggin"
  1353. ,Title="[patch 3/3] radix-tree: {RCU} lockless readside"
  1354. ,month="June"
  1355. ,day="20"
  1356. ,year="2006"
  1357. ,note="Available:
  1358. \url{http://lkml.org/lkml/2006/6/20/238}
  1359. [Viewed March 25, 2008]"
  1360. ,annotation={
  1361. RCU-protected radix tree.
  1362. }
  1363. }
  1364. @Conference{PaulEMcKenney2006b
  1365. ,Author="Paul E. McKenney and Dipankar Sarma and Ingo Molnar and
  1366. Suparna Bhattacharya"
  1367. ,Title="Extending {RCU} for Realtime and Embedded Workloads"
  1368. ,Booktitle="{Ottawa Linux Symposium}"
  1369. ,Month="July"
  1370. ,Year="2006"
  1371. ,pages="v2 123-138"
  1372. ,note="Available:
  1373. \url{http://www.linuxsymposium.org/2006/view_abstract.php?content_key=184}
  1374. \url{http://www.rdrop.com/users/paulmck/RCU/OLSrtRCU.2006.08.11a.pdf}
  1375. [Viewed January 1, 2007]"
  1376. ,annotation={
  1377. Described how to improve the -rt implementation of realtime RCU.
  1378. }
  1379. }
  1380. @unpublished{WikipediaRCU
  1381. ,Author="Paul E. McKenney and Chris Purcell and Algae and Ben Schumin and
  1382. Gaius Cornelius and Qwertyus and Neil Conway and Sbw and Blainster and
  1383. Canis Rufus and Zoicon5 and Anome and Hal Eisen"
  1384. ,Title="Read-Copy Update"
  1385. ,month="July"
  1386. ,day="8"
  1387. ,year="2006"
  1388. ,note="\url{https://en.wikipedia.org/wiki/Read-copy-update}"
  1389. ,annotation={
  1390. Wikipedia RCU page as of July 8 2006.
  1391. [Viewed August 21, 2006]
  1392. }
  1393. }
  1394. @Conference{NickPiggin2006LocklessPageCache
  1395. ,Author="Nick Piggin"
  1396. ,Title="A Lockless Pagecache in Linux---Introduction, Progress, Performance"
  1397. ,Booktitle="{Ottawa Linux Symposium}"
  1398. ,Month="July"
  1399. ,Year="2006"
  1400. ,pages="v2 249-254"
  1401. ,note="Available:
  1402. \url{http://www.linuxsymposium.org/2006/view_abstract.php?content_key=184}
  1403. [Viewed January 11, 2009]"
  1404. ,annotation={
  1405. Uses RCU-protected radix tree for a lockless page cache.
  1406. }
  1407. }
  1408. @unpublished{PaulEMcKenney2006c
  1409. ,Author="Paul E. McKenney"
  1410. ,Title="Sleepable {RCU}"
  1411. ,month="October"
  1412. ,day="9"
  1413. ,year="2006"
  1414. ,note="Available:
  1415. \url{http://lwn.net/Articles/202847/}
  1416. Revised:
  1417. \url{http://www.rdrop.com/users/paulmck/RCU/srcu.2007.01.14a.pdf}
  1418. [Viewed August 21, 2006]"
  1419. ,annotation={
  1420. LWN article introducing SRCU.
  1421. }
  1422. }
  1423. @unpublished{RobertOlsson2006a
  1424. ,Author="Robert Olsson and Stefan Nilsson"
  1425. ,Title="{TRASH}: A dynamic {LC}-trie and hash data structure"
  1426. ,month="August"
  1427. ,day="18"
  1428. ,year="2006"
  1429. ,note="\url{http://www.nada.kth.se/~snilsson/publications/TRASH/trash.pdf}"
  1430. ,annotation={
  1431. RCU-protected dynamic trie-hash combination.
  1432. [Viewed March 4, 2011]
  1433. }
  1434. }
  1435. @unpublished{ChristophHellwig2006RCU2SRCU
  1436. ,Author="Christoph Hellwig"
  1437. ,Title="Re: {[-mm PATCH 1/4]} {RCU}: split classic rcu"
  1438. ,month="September"
  1439. ,day="28"
  1440. ,year="2006"
  1441. ,note="Available:
  1442. \url{http://lkml.org/lkml/2006/9/28/160}
  1443. [Viewed March 27, 2008]"
  1444. }
  1445. @unpublished{PaulEMcKenneyRCUusagePage
  1446. ,Author="Paul E. McKenney"
  1447. ,Title="{RCU} {Linux} Usage"
  1448. ,month="October"
  1449. ,year="2006"
  1450. ,note="Available:
  1451. \url{http://www.rdrop.com/users/paulmck/RCU/linuxusage.html}
  1452. [Viewed January 14, 2007]"
  1453. ,annotation={
  1454. Paul McKenney's RCU page showing graphs plotting Linux-kernel
  1455. usage of RCU.
  1456. }
  1457. }
  1458. @unpublished{PaulEMcKenneyRCUusageRawDataPage
  1459. ,Author="Paul E. McKenney"
  1460. ,Title="Read-Copy Update {(RCU)} Usage in {Linux} Kernel"
  1461. ,month="October"
  1462. ,year="2006"
  1463. ,note="Available:
  1464. \url{http://www.rdrop.com/users/paulmck/RCU/linuxusage/rculocktab.html}
  1465. [Viewed January 14, 2007]"
  1466. ,annotation={
  1467. Paul McKenney's RCU page showing Linux usage of RCU in tabular
  1468. form, with links to corresponding cscope databases.
  1469. }
  1470. }
  1471. @unpublished{GauthamShenoy2006RCUrwlock
  1472. ,Author="Gautham R. Shenoy"
  1473. ,Title="[PATCH 4/5] lock\_cpu\_hotplug: Redesign - Lightweight implementation of lock\_cpu\_hotplug"
  1474. ,month="October"
  1475. ,year="2006"
  1476. ,day=26
  1477. ,note="Available:
  1478. \url{http://lkml.org/lkml/2006/10/26/73}
  1479. [Viewed January 26, 2009]"
  1480. ,annotation={
  1481. RCU-based reader-writer lock that allows readers to proceed with
  1482. no memory barriers or atomic instruction in absence of writers.
  1483. If writer do show up, readers must of course wait as required by
  1484. the semantics of reader-writer locking. This is a recursive
  1485. lock.
  1486. }
  1487. }
  1488. @unpublished{JensAxboe2006SlowSRCU
  1489. ,Author="Jens Axboe"
  1490. ,Title="Re: [patch] cpufreq: mark \url{cpufreq_tsc()} as
  1491. \url{core_initcall_sync}"
  1492. ,month="November"
  1493. ,year="2006"
  1494. ,day=17
  1495. ,note="Available:
  1496. \url{http://lkml.org/lkml/2006/11/17/56}
  1497. [Viewed May 28, 2007]"
  1498. ,annotation={
  1499. SRCU's grace periods are too slow for Jens, even after a
  1500. factor-of-three speedup.
  1501. Sped-up version of SRCU at http://lkml.org/lkml/2006/11/17/359.
  1502. }
  1503. }
  1504. @unpublished{OlegNesterov2006QRCU
  1505. ,Author="Oleg Nesterov"
  1506. ,Title="Re: [patch] cpufreq: mark {\tt cpufreq\_tsc()} as
  1507. {\tt core\_initcall\_sync}"
  1508. ,month="November"
  1509. ,year="2006"
  1510. ,day=19
  1511. ,note="Available:
  1512. \url{http://lkml.org/lkml/2006/11/19/69}
  1513. [Viewed May 28, 2007]"
  1514. ,annotation={
  1515. First cut of QRCU. Expanded/corrected versions followed.
  1516. Used to be OlegNesterov2007QRCU, now time-corrected.
  1517. }
  1518. }
  1519. @unpublished{OlegNesterov2006aQRCU
  1520. ,Author="Oleg Nesterov"
  1521. ,Title="Re: [RFC, PATCH 1/2] qrcu: {"quick"} srcu implementation"
  1522. ,month="November"
  1523. ,year="2006"
  1524. ,day=30
  1525. ,note="Available:
  1526. \url{http://lkml.org/lkml/2006/11/29/330}
  1527. [Viewed November 26, 2008]"
  1528. ,annotation={
  1529. Expanded/corrected version of QRCU.
  1530. Used to be OlegNesterov2007aQRCU, now time-corrected.
  1531. }
  1532. }
  1533. @unpublished{EvgeniyPolyakov2006RCUslowdown
  1534. ,Author="Evgeniy Polyakov"
  1535. ,Title="Badness in postponing work"
  1536. ,month="December"
  1537. ,year="2006"
  1538. ,day=05
  1539. ,note="Available:
  1540. \url{http://www.ioremap.net/node/41}
  1541. [Viewed October 28, 2008]"
  1542. ,annotation={
  1543. Using RCU as a pure delay leads to a 2.5x slowdown in skbs in
  1544. the Linux kernel.
  1545. }
  1546. }
  1547. @inproceedings{ChrisMatthews2006ClusteredObjectsRCU
  1548. ,author = {Matthews, Chris and Coady, Yvonne and Appavoo, Jonathan}
  1549. ,title = {Portability events: a programming model for scalable system infrastructures}
  1550. ,booktitle = {PLOS '06: Proceedings of the 3rd workshop on Programming languages and operating systems}
  1551. ,year = {2006}
  1552. ,isbn = {1-59593-577-0}
  1553. ,pages = {11}
  1554. ,location = {San Jose, California}
  1555. ,doi = {http://doi.acm.org/10.1145/1215995.1216006}
  1556. ,publisher = {ACM}
  1557. ,address = {New York, NY, USA}
  1558. ,annotation={
  1559. Uses K42's RCU-like functionality to manage clustered-object
  1560. lifetimes.
  1561. }
  1562. }
  1563. @article{DilmaDaSilva2006K42
  1564. ,author = {Silva, Dilma Da and Krieger, Orran and Wisniewski, Robert W. and Waterland, Amos and Tam, David and Baumann, Andrew}
  1565. ,title = {K42: an infrastructure for operating system research}
  1566. ,journal = {SIGOPS Oper. Syst. Rev.}
  1567. ,volume = {40}
  1568. ,number = {2}
  1569. ,year = {2006}
  1570. ,issn = {0163-5980}
  1571. ,pages = {34--42}
  1572. ,doi = {http://doi.acm.org/10.1145/1131322.1131333}
  1573. ,publisher = {ACM}
  1574. ,address = {New York, NY, USA}
  1575. ,annotation={
  1576. Describes relationship of K42 generations to RCU.
  1577. }
  1578. }
  1579. # CoreyMinyard2007list_splice_rcu
  1580. @unpublished{CoreyMinyard2007list:splice:rcu
  1581. ,Author="Corey Minyard and Paul E. McKenney"
  1582. ,Title="{[PATCH]} add an {RCU} version of list splicing"
  1583. ,month="January"
  1584. ,year="2007"
  1585. ,day=3
  1586. ,note="Available:
  1587. \url{http://lkml.org/lkml/2007/1/3/112}
  1588. [Viewed May 28, 2007]"
  1589. ,annotation={
  1590. Patch for list_splice_rcu().
  1591. }
  1592. }
  1593. @unpublished{PaulEMcKenney2007rcubarrier
  1594. ,Author="Paul E. McKenney"
  1595. ,Title="{RCU} and Unloadable Modules"
  1596. ,month="January"
  1597. ,day="14"
  1598. ,year="2007"
  1599. ,note="Available:
  1600. \url{http://lwn.net/Articles/217484/}
  1601. [Viewed November 22, 2007]"
  1602. ,annotation={
  1603. LWN article introducing the rcu_barrier() primitive.
  1604. }
  1605. }
  1606. @unpublished{PeterZijlstra2007SyncBarrier
  1607. ,Author="Peter Zijlstra and Ingo Molnar"
  1608. ,Title="{[PATCH 3/7]} barrier: a scalable synchonisation barrier"
  1609. ,month="January"
  1610. ,year="2007"
  1611. ,day=28
  1612. ,note="Available:
  1613. \url{http://lkml.org/lkml/2007/1/28/34}
  1614. [Viewed March 27, 2008]"
  1615. ,annotation={
  1616. RCU-like implementation for frequent updaters and rare readers(!).
  1617. Subsumed into QRCU. Maybe...
  1618. }
  1619. }
  1620. @unpublished{PaulEMcKenney2007BoostRCU
  1621. ,Author="Paul E. McKenney"
  1622. ,Title="Priority-Boosting {RCU} Read-Side Critical Sections"
  1623. ,month="February"
  1624. ,day="5"
  1625. ,year="2007"
  1626. ,note="\url{http://lwn.net/Articles/220677/}"
  1627. ,annotation={
  1628. LWN article introducing RCU priority boosting.
  1629. Revised:
  1630. http://www.rdrop.com/users/paulmck/RCU/RCUbooststate.2007.04.16a.pdf
  1631. [Viewed September 7, 2007]
  1632. }
  1633. }
  1634. @unpublished{PaulMcKenney2007QRCUpatch
  1635. ,Author="Paul E. McKenney"
  1636. ,Title="{[PATCH]} {QRCU} with lockless fastpath"
  1637. ,month="February"
  1638. ,year="2007"
  1639. ,day=24
  1640. ,note="Available:
  1641. \url{http://lkml.org/lkml/2007/2/25/18}
  1642. [Viewed March 27, 2008]"
  1643. ,annotation={
  1644. Patch for QRCU supplying lock-free fast path.
  1645. }
  1646. }
  1647. @article{JonathanAppavoo2007K42RCU
  1648. ,author = {Appavoo, Jonathan and Silva, Dilma Da and Krieger, Orran and Auslander, Marc and Ostrowski, Michal and Rosenburg, Bryan and Waterland, Amos and Wisniewski, Robert W. and Xenidis, Jimi and Stumm, Michael and Soares, Livio}
  1649. ,title = {Experience distributing objects in an SMMP OS}
  1650. ,journal = {ACM Trans. Comput. Syst.}
  1651. ,volume = {25}
  1652. ,number = {3}
  1653. ,year = {2007}
  1654. ,issn = {0734-2071}
  1655. ,pages = {6/1--6/52}
  1656. ,doi = {http://doi.acm.org/10.1145/1275517.1275518}
  1657. ,publisher = {ACM}
  1658. ,address = {New York, NY, USA}
  1659. ,annotation={
  1660. Role of RCU in K42.
  1661. }
  1662. }
  1663. @conference{RobertOlsson2007Trash
  1664. ,Author="Robert Olsson and Stefan Nilsson"
  1665. ,Title="{TRASH}: A dynamic {LC}-trie and hash data structure"
  1666. ,booktitle="Workshop on High Performance Switching and Routing (HPSR'07)"
  1667. ,month="May"
  1668. ,year="2007"
  1669. ,note="Available:
  1670. \url{http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4281239}
  1671. [Viewed October 1, 2010]"
  1672. ,annotation={
  1673. RCU-protected dynamic trie-hash combination.
  1674. }
  1675. }
  1676. @conference{PeterZijlstra2007ConcurrentPagecacheRCU
  1677. ,Author="Peter Zijlstra"
  1678. ,Title="Concurrent Pagecache"
  1679. ,Booktitle="Linux Symposium"
  1680. ,month="June"
  1681. ,year="2007"
  1682. ,address="Ottawa, Canada"
  1683. ,note="Available:
  1684. \url{http://ols.108.redhat.com/2007/Reprints/zijlstra-Reprint.pdf}
  1685. [Viewed April 14, 2008]"
  1686. ,annotation={
  1687. Page-cache modifications permitting RCU readers and concurrent
  1688. updates.
  1689. }
  1690. }
  1691. @unpublished{PaulEMcKenney2007whatisRCU
  1692. ,Author="Paul E. McKenney"
  1693. ,Title="What is {RCU}?"
  1694. ,year="2007"
  1695. ,month="07"
  1696. ,note="Available:
  1697. \url{http://www.rdrop.com/users/paulmck/RCU/whatisRCU.html}
  1698. [Viewed July 6, 2007]"
  1699. ,annotation={
  1700. Describes RCU in Linux kernel.
  1701. }
  1702. }
  1703. @unpublished{PaulEMcKenney2007QRCUspin
  1704. ,Author="Paul E. McKenney"
  1705. ,Title="Using {Promela} and {Spin} to verify parallel algorithms"
  1706. ,month="August"
  1707. ,day="1"
  1708. ,year="2007"
  1709. ,note="Available:
  1710. \url{http://lwn.net/Articles/243851/}
  1711. [Viewed September 8, 2007]"
  1712. ,annotation={
  1713. LWN article describing Promela and spin, and also using Oleg
  1714. Nesterov's QRCU as an example (with Paul McKenney's fastpath).
  1715. Merged patch at: http://lkml.org/lkml/2007/2/25/18
  1716. }
  1717. }
  1718. @unpublished{PaulEMcKenney2007WG21DDOatomics
  1719. ,Author="Paul E. McKenney and Hans-J. Boehm and Lawrence Crowl"
  1720. ,Title="C++ Data-Dependency Ordering: Atomics and Memory Model"
  1721. ,month="August"
  1722. ,day="3"
  1723. ,year="2007"
  1724. ,note="Available:
  1725. \url{http://open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2664.htm}
  1726. [Viewed December 7, 2009]"
  1727. ,annotation={
  1728. RCU for C++, parts 1 and 2.
  1729. }
  1730. }
  1731. @unpublished{PaulEMcKenney2007WG21DDOannotation
  1732. ,Author="Paul E. McKenney and Lawrence Crowl"
  1733. ,Title="C++ Data-Dependency Ordering: Function Annotation"
  1734. ,month="September"
  1735. ,day="18"
  1736. ,year="2008"
  1737. ,note="Available:
  1738. \url{http://open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2782.htm}
  1739. [Viewed December 7, 2009]"
  1740. ,annotation={
  1741. RCU for C++, part 2, updated many times.
  1742. }
  1743. }
  1744. @unpublished{PaulEMcKenney2007PreemptibleRCUPatch
  1745. ,Author="Paul E. McKenney"
  1746. ,Title="[PATCH RFC 0/9] {RCU}: Preemptible {RCU}"
  1747. ,month="September"
  1748. ,day="10"
  1749. ,year="2007"
  1750. ,note="Available:
  1751. \url{http://lkml.org/lkml/2007/9/10/213}
  1752. [Viewed October 25, 2007]"
  1753. ,annotation={
  1754. Final patch for preemptable RCU to -rt. (Later patches were
  1755. to mainline, eventually incorporated.)
  1756. }
  1757. }
  1758. @unpublished{PaulEMcKenney2007PreemptibleRCU
  1759. ,Author="Paul E. McKenney"
  1760. ,Title="The design of preemptible read-copy-update"
  1761. ,month="October"
  1762. ,day="8"
  1763. ,year="2007"
  1764. ,note="Available:
  1765. \url{http://lwn.net/Articles/253651/}
  1766. [Viewed October 25, 2007]"
  1767. ,annotation={
  1768. LWN article describing the design of preemptible RCU.
  1769. }
  1770. }
  1771. @article{ThomasEHart2007a
  1772. ,Author="Thomas E. Hart and Paul E. McKenney and Angela Demke Brown and Jonathan Walpole"
  1773. ,Title="Performance of memory reclamation for lockless synchronization"
  1774. ,journal="J. Parallel Distrib. Comput."
  1775. ,volume={67}
  1776. ,number="12"
  1777. ,year="2007"
  1778. ,issn="0743-7315"
  1779. ,pages="1270--1285"
  1780. ,doi="http://dx.doi.org/10.1016/j.jpdc.2007.04.010"
  1781. ,publisher="Academic Press, Inc."
  1782. ,address="Orlando, FL, USA"
  1783. ,annotation={
  1784. Compares QSBR, HPBR, EBR, and lock-free reference counting.
  1785. Journal version of ThomasEHart2006a.
  1786. }
  1787. }
  1788. # MathieuDesnoyers2007call_rcu_schedNeeded
  1789. @unpublished{MathieuDesnoyers2007call:rcu:schedNeeded
  1790. ,Author="Mathieu Desnoyers"
  1791. ,Title="Re: [patch 1/2] {Linux} Kernel Markers - Support Multiple Probes"
  1792. ,month="December"
  1793. ,day="20"
  1794. ,year="2007"
  1795. ,note="Available:
  1796. \url{http://lkml.org/lkml/2007/12/20/244}
  1797. [Viewed March 27, 2008]"
  1798. ,annotation={
  1799. Request for call_rcu_sched() and rcu_barrier_sched().
  1800. }
  1801. }
  1802. ########################################################################
  1803. #
  1804. # "What is RCU?" LWN series.
  1805. #
  1806. # http://lwn.net/Articles/262464/ (What is RCU, Fundamentally?)
  1807. # http://lwn.net/Articles/263130/ (What is RCU's Usage?)
  1808. # http://lwn.net/Articles/264090/ (What is RCU's API?)
  1809. @unpublished{PaulEMcKenney2007WhatIsRCUFundamentally
  1810. ,Author="Paul E. McKenney and Jonathan Walpole"
  1811. ,Title="What is {RCU}, Fundamentally?"
  1812. ,month="December"
  1813. ,day="17"
  1814. ,year="2007"
  1815. ,note="Available:
  1816. \url{http://lwn.net/Articles/262464/}
  1817. [Viewed December 27, 2007]"
  1818. ,annotation={
  1819. Lays out the three basic components of RCU: (1) publish-subscribe,
  1820. (2) wait for pre-existing readers to complete, and (2) maintain
  1821. multiple versions.
  1822. }
  1823. }
  1824. @unpublished{PaulEMcKenney2008WhatIsRCUUsage
  1825. ,Author="Paul E. McKenney"
  1826. ,Title="What is {RCU}? Part 2: Usage"
  1827. ,month="January"
  1828. ,day="4"
  1829. ,year="2008"
  1830. ,note="Available:
  1831. \url{http://lwn.net/Articles/263130/}
  1832. [Viewed January 4, 2008]"
  1833. ,annotation={
  1834. Lays out six uses of RCU:
  1835. 1. RCU is a Reader-Writer Lock Replacement
  1836. 2. RCU is a Restricted Reference-Counting Mechanism
  1837. 3. RCU is a Bulk Reference-Counting Mechanism
  1838. 4. RCU is a Poor Man's Garbage Collector
  1839. 5. RCU is a Way of Providing Existence Guarantees
  1840. 6. RCU is a Way of Waiting for Things to Finish
  1841. }
  1842. }
  1843. @unpublished{PaulEMcKenney2008WhatIsRCUAPI
  1844. ,Author="Paul E. McKenney"
  1845. ,Title="{RCU} part 3: the {RCU} {API}"
  1846. ,month="January"
  1847. ,day="17"
  1848. ,year="2008"
  1849. ,note="Available:
  1850. \url{http://lwn.net/Articles/264090/}
  1851. [Viewed January 10, 2008]"
  1852. ,annotation={
  1853. Gives an overview of the Linux-kernel RCU API and a brief annotated RCU
  1854. bibliography.
  1855. }
  1856. }
  1857. #
  1858. # "What is RCU?" LWN series.
  1859. #
  1860. ########################################################################
  1861. @unpublished{SteveRostedt2008dyntickRCUpatch
  1862. ,Author="Steven Rostedt and Paul E. McKenney"
  1863. ,Title="{[PATCH]} add support for dynamic ticks and preempt rcu"
  1864. ,month="January"
  1865. ,day="29"
  1866. ,year="2008"
  1867. ,note="Available:
  1868. \url{http://lkml.org/lkml/2008/1/29/208}
  1869. [Viewed March 27, 2008]"
  1870. ,annotation={
  1871. Patch that prevents preemptible RCU from unnecessarily waking
  1872. up dynticks-idle CPUs.
  1873. }
  1874. }
  1875. @unpublished{PaulEMcKenney2008LKMLDependencyOrdering
  1876. ,Author="Paul E. McKenney"
  1877. ,Title="Re: [PATCH 02/22 -v7] Add basic support for gcc profiler instrumentation"
  1878. ,month="February"
  1879. ,day="1"
  1880. ,year="2008"
  1881. ,note="Available:
  1882. \url{http://lkml.org/lkml/2008/2/2/255}
  1883. [Viewed October 18, 2008]"
  1884. ,annotation={
  1885. Explanation of compilers violating dependency ordering.
  1886. }
  1887. }
  1888. @Conference{PaulEMcKenney2008Beijing
  1889. ,Author="Paul E. McKenney"
  1890. ,Title="Introducing Technology Into {Linux} Or:
  1891. Introducing your technology Into {Linux} will require introducing a
  1892. lot of {Linux} into your technology!!!"
  1893. ,Booktitle="2008 Linux Developer Symposium - China"
  1894. ,Publisher="OSS China"
  1895. ,Month="February"
  1896. ,Year="2008"
  1897. ,Address="Beijing, China"
  1898. ,note="Available:
  1899. \url{http://www.rdrop.com/users/paulmck/RCU/TechIntroLinux.2008.02.19a.pdf}
  1900. [Viewed August 12, 2008]"
  1901. }
  1902. @unpublished{PaulEMcKenney2008dynticksRCU
  1903. ,Author="Paul E. McKenney and Steven Rostedt"
  1904. ,Title="Integrating and Validating dynticks and Preemptable RCU"
  1905. ,month="April"
  1906. ,day="24"
  1907. ,year="2008"
  1908. ,note="Available:
  1909. \url{http://lwn.net/Articles/279077/}
  1910. [Viewed April 24, 2008]"
  1911. ,annotation={
  1912. Describes use of Promela and Spin to validate (and fix!) the
  1913. dynticks/RCU interface.
  1914. }
  1915. }
  1916. @article{DinakarGuniguntala2008IBMSysJ
  1917. ,author="D. Guniguntala and P. E. McKenney and J. Triplett and J. Walpole"
  1918. ,title="The read-copy-update mechanism for supporting real-time applications on shared-memory multiprocessor systems with {Linux}"
  1919. ,Year="2008"
  1920. ,Month="May"
  1921. ,journal="IBM Systems Journal"
  1922. ,volume="47"
  1923. ,number="2"
  1924. ,pages="221-236"
  1925. ,annotation={
  1926. RCU, realtime RCU, sleepable RCU, performance.
  1927. http://www.research.ibm.com/journal/sj/472/guniguntala.pdf
  1928. [Viewed April 24, 2008]
  1929. }
  1930. }
  1931. @unpublished{LaiJiangshan2008NewClassicAlgorithm
  1932. ,Author="Lai Jiangshan"
  1933. ,Title="[{RFC}][{PATCH}] rcu classic: new algorithm for callbacks-processing"
  1934. ,month="June"
  1935. ,day="3"
  1936. ,year="2008"
  1937. ,note="Available:
  1938. \url{http://lkml.org/lkml/2008/6/2/539}
  1939. [Viewed December 10, 2008]"
  1940. ,annotation={
  1941. Updated RCU classic algorithm. Introduced multi-tailed list
  1942. for RCU callbacks and also pulling common code into
  1943. __call_rcu().
  1944. }
  1945. }
  1946. @article{PaulEMcKenney2008RCUOSR
  1947. ,author="Paul E. McKenney and Jonathan Walpole"
  1948. ,title="Introducing technology into the {Linux} kernel: a case study"
  1949. ,Year="2008"
  1950. ,journal="SIGOPS Oper. Syst. Rev."
  1951. ,volume="42"
  1952. ,number="5"
  1953. ,pages="4--17"
  1954. ,issn="0163-5980"
  1955. ,doi={http://doi.acm.org/10.1145/1400097.1400099}
  1956. ,publisher="ACM"
  1957. ,address="New York, NY, USA"
  1958. ,annotation={
  1959. Linux changed RCU to a far greater degree than RCU has changed Linux.
  1960. http://portal.acm.org/citation.cfm?doid=1400097.1400099
  1961. }
  1962. }
  1963. @unpublished{ManfredSpraul2008StateMachineRCU
  1964. ,Author="Manfred Spraul"
  1965. ,Title="[{RFC}, {PATCH}] state machine based rcu"
  1966. ,month="August"
  1967. ,day="21"
  1968. ,year="2008"
  1969. ,note="Available:
  1970. \url{http://lkml.org/lkml/2008/8/21/336}
  1971. [Viewed December 8, 2008]"
  1972. ,annotation={
  1973. State-based RCU. One key thing that this patch does is to
  1974. separate the dynticks handling of NMIs and IRQs.
  1975. }
  1976. }
  1977. @unpublished{ManfredSpraul2008dyntickIRQNMI
  1978. ,Author="Manfred Spraul"
  1979. ,Title="Re: [{RFC}, {PATCH}] v4 scalable classic {RCU} implementation"
  1980. ,month="September"
  1981. ,day="6"
  1982. ,year="2008"
  1983. ,note="Available:
  1984. \url{http://lkml.org/lkml/2008/9/6/86}
  1985. [Viewed December 8, 2008]"
  1986. ,annotation={
  1987. Manfred notes a fix required to my attempt to separate irq
  1988. and NMI processing for hierarchical RCU's dynticks interface.
  1989. }
  1990. }
  1991. # Was PaulEMcKenney2011cyclicRCU
  1992. @techreport{PaulEMcKenney2008cyclicRCU
  1993. ,author="Paul E. McKenney"
  1994. ,title="Efficient Support of Consistent Cyclic Search With Read-Copy Update"
  1995. ,institution="US Patent and Trademark Office"
  1996. ,address="Washington, DC"
  1997. ,year="2008"
  1998. ,number="US Patent 7,426,511"
  1999. ,month="September"
  2000. ,pages="23"
  2001. ,annotation={
  2002. Maintains an additional level of indirection to allow
  2003. readers to confine themselves to the desired snapshot of the
  2004. data structure. Only permits one update at a time.
  2005. }
  2006. }
  2007. @unpublished{PaulEMcKenney2008HierarchicalRCU
  2008. ,Author="Paul E. McKenney"
  2009. ,Title="Hierarchical {RCU}"
  2010. ,month="November"
  2011. ,day="3"
  2012. ,year="2008"
  2013. ,note="\url{http://lwn.net/Articles/305782/}"
  2014. ,annotation={
  2015. RCU with combining-tree-based grace-period detection,
  2016. permitting it to handle thousands of CPUs.
  2017. [Viewed November 6, 2008]
  2018. }
  2019. }
  2020. @unpublished{PaulEMcKenney2009BloatwatchRCU
  2021. ,Author="Paul E. McKenney"
  2022. ,Title="Re: [PATCH fyi] RCU: the bloatwatch edition"
  2023. ,month="January"
  2024. ,day="14"
  2025. ,year="2009"
  2026. ,note="Available:
  2027. \url{http://lkml.org/lkml/2009/1/14/449}
  2028. [Viewed January 15, 2009]"
  2029. ,annotation={
  2030. Small-footprint implementation of RCU for uniprocessor
  2031. embedded applications -- and also for exposition purposes.
  2032. }
  2033. }
  2034. @conference{PaulEMcKenney2009MaliciousURCU
  2035. ,Author="Paul E. McKenney"
  2036. ,Title="Using a Malicious User-Level {RCU} to Torture {RCU}-Based Algorithms"
  2037. ,Booktitle="linux.conf.au 2009"
  2038. ,month="January"
  2039. ,year="2009"
  2040. ,address="Hobart, Australia"
  2041. ,note="Available:
  2042. \url{http://www.rdrop.com/users/paulmck/RCU/urcutorture.2009.01.22a.pdf}
  2043. [Viewed February 2, 2009]"
  2044. ,annotation={
  2045. Realtime RCU and torture-testing RCU uses.
  2046. }
  2047. }
  2048. @unpublished{MathieuDesnoyers2009URCU
  2049. ,Author="Mathieu Desnoyers"
  2050. ,Title="[{RFC} git tree] Userspace {RCU} (urcu) for {Linux}"
  2051. ,month="February"
  2052. ,day="5"
  2053. ,year="2009"
  2054. ,note="\url{http://lttng.org/urcu}"
  2055. ,annotation={
  2056. Mathieu Desnoyers's user-space RCU implementation.
  2057. git://lttng.org/userspace-rcu.git
  2058. http://lttng.org/cgi-bin/gitweb.cgi?p=userspace-rcu.git
  2059. http://lttng.org/urcu
  2060. http://lkml.org/lkml/2009/2/5/572
  2061. }
  2062. }
  2063. @unpublished{PaulEMcKenney2009LWNBloatWatchRCU
  2064. ,Author="Paul E. McKenney"
  2065. ,Title="{RCU}: The {Bloatwatch} Edition"
  2066. ,month="March"
  2067. ,day="17"
  2068. ,year="2009"
  2069. ,note="Available:
  2070. \url{http://lwn.net/Articles/323929/}
  2071. [Viewed March 20, 2009]"
  2072. ,annotation={
  2073. Uniprocessor assumptions allow simplified RCU implementation.
  2074. }
  2075. }
  2076. @unpublished{EvgeniyPolyakov2009EllipticsNetwork
  2077. ,Author="Evgeniy Polyakov"
  2078. ,Title="The Elliptics Network"
  2079. ,month="April"
  2080. ,day="17"
  2081. ,year="2009"
  2082. ,note="Available:
  2083. \url{http://www.ioremap.net/projects/elliptics}
  2084. [Viewed April 30, 2009]"
  2085. ,annotation={
  2086. Distributed hash table with transactions, using elliptic
  2087. hash functions to distribute data.
  2088. }
  2089. }
  2090. @unpublished{PaulEMcKenney2009expeditedRCU
  2091. ,Author="Paul E. McKenney"
  2092. ,Title="[{PATCH} -tip 0/3] expedited 'big hammer' {RCU} grace periods"
  2093. ,month="June"
  2094. ,day="25"
  2095. ,year="2009"
  2096. ,note="Available:
  2097. \url{http://lkml.org/lkml/2009/6/25/306}
  2098. [Viewed August 16, 2009]"
  2099. ,annotation={
  2100. First posting of expedited RCU to be accepted into -tip.
  2101. }
  2102. }
  2103. @unpublished{PaulEMcKenney2009fastRTRCU
  2104. ,Author="Paul E. McKenney"
  2105. ,Title="[{PATCH} {RFC} -tip 0/4] {RCU} cleanups and simplified preemptable {RCU}"
  2106. ,month="July"
  2107. ,day="23"
  2108. ,year="2009"
  2109. ,note="Available:
  2110. \url{http://lkml.org/lkml/2009/7/23/294}
  2111. [Viewed August 15, 2009]"
  2112. ,annotation={
  2113. First posting of simple and fast preemptable RCU.
  2114. }
  2115. }
  2116. @unpublished{JoshTriplett2009RPHash
  2117. ,Author="Josh Triplett"
  2118. ,Title="Scalable concurrent hash tables via relativistic programming"
  2119. ,month="September"
  2120. ,year="2009"
  2121. ,note="Linux Plumbers Conference presentation"
  2122. ,annotation={
  2123. RP fun with hash tables.
  2124. Superseded by JoshTriplett2010RPHash
  2125. }
  2126. }
  2127. @phdthesis{MathieuDesnoyersPhD
  2128. , title = "Low-Impact Operating System Tracing"
  2129. , author = "Mathieu Desnoyers"
  2130. , school = "Ecole Polytechnique de Montr\'{e}al"
  2131. , month = "December"
  2132. , year = 2009
  2133. ,note="Available:
  2134. \url{http://www.lttng.org/pub/thesis/desnoyers-dissertation-2009-12.pdf}
  2135. [Viewed December 9, 2009]"
  2136. ,annotation={
  2137. Chapter 6 (page 97) covers user-level RCU.
  2138. }
  2139. }
  2140. @unpublished{RelativisticProgrammingWiki
  2141. ,Author="Josh Triplett and Paul E. McKenney and Jonathan Walpole"
  2142. ,Title="Relativistic Programming"
  2143. ,month="September"
  2144. ,year="2009"
  2145. ,note="Available:
  2146. \url{http://wiki.cs.pdx.edu/rp/}
  2147. [Viewed December 9, 2009]"
  2148. ,annotation={
  2149. Main Relativistic Programming Wiki.
  2150. }
  2151. }
  2152. @conference{PaulEMcKenney2009DeterministicRCU
  2153. ,Author="Paul E. McKenney"
  2154. ,Title="Deterministic Synchronization in Multicore Systems: the Role of {RCU}"
  2155. ,Booktitle="Eleventh Real Time Linux Workshop"
  2156. ,month="September"
  2157. ,year="2009"
  2158. ,address="Dresden, Germany"
  2159. ,note="Available:
  2160. \url{http://www.rdrop.com/users/paulmck/realtime/paper/DetSyncRCU.2009.08.18a.pdf}
  2161. [Viewed January 14, 2009]"
  2162. }
  2163. @unpublished{PaulEMcKenney2009HuntingHeisenbugs
  2164. ,Author="Paul E. McKenney"
  2165. ,Title="Hunting Heisenbugs"
  2166. ,month="November"
  2167. ,year="2009"
  2168. ,day="1"
  2169. ,note="Available:
  2170. \url{http://paulmck.livejournal.com/14639.html}
  2171. [Viewed June 4, 2010]"
  2172. ,annotation={
  2173. Day-one bug in Tree RCU that took forever to track down.
  2174. }
  2175. }
  2176. @unpublished{MathieuDesnoyers2009defer:rcu
  2177. ,Author="Mathieu Desnoyers"
  2178. ,Title="Kernel RCU: shrink the size of the struct rcu\_head"
  2179. ,month="December"
  2180. ,year="2009"
  2181. ,note="Available:
  2182. \url{http://lkml.org/lkml/2009/10/18/129}
  2183. [Viewed December 29, 2009]"
  2184. ,annotation={
  2185. Mathieu proposed defer_rcu() with fixed-size per-thread pool
  2186. of RCU callbacks.
  2187. }
  2188. }
  2189. @unpublished{MathieuDesnoyers2009VerifPrePub
  2190. ,Author="Mathieu Desnoyers and Paul E. McKenney and Michel R. Dagenais"
  2191. ,Title="Multi-Core Systems Modeling for Formal Verification of Parallel Algorithms"
  2192. ,month="December"
  2193. ,year="2009"
  2194. ,note="Submitted to IEEE TPDS"
  2195. ,annotation={
  2196. OOMem model for Mathieu's user-level RCU mechanical proof of
  2197. correctness.
  2198. }
  2199. }
  2200. @unpublished{MathieuDesnoyers2009URCUPrePub
  2201. ,Author="Mathieu Desnoyers and Paul E. McKenney and Alan Stern and Michel R. Dagenais and Jonathan Walpole"
  2202. ,Title="User-Level Implementations of Read-Copy Update"
  2203. ,month="December"
  2204. ,year="2010"
  2205. ,url={\url{http://www.computer.org/csdl/trans/td/2012/02/ttd2012020375-abs.html}}
  2206. ,annotation={
  2207. RCU overview, desiderata, semi-formal semantics, user-level RCU
  2208. usage scenarios, three classes of RCU implementation, wait-free
  2209. RCU updates, RCU grace-period batching, update overhead,
  2210. http://www.rdrop.com/users/paulmck/RCU/urcu-main-accepted.2011.08.30a.pdf
  2211. http://www.rdrop.com/users/paulmck/RCU/urcu-supp-accepted.2011.08.30a.pdf
  2212. Superseded by MathieuDesnoyers2012URCU.
  2213. }
  2214. }
  2215. @inproceedings{HariKannan2009DynamicAnalysisRCU
  2216. ,author = {Kannan, Hari}
  2217. ,title = {Ordering decoupled metadata accesses in multiprocessors}
  2218. ,booktitle = {MICRO 42: Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture}
  2219. ,year = {2009}
  2220. ,isbn = {978-1-60558-798-1}
  2221. ,pages = {381--390}
  2222. ,location = {New York, New York}
  2223. ,doi = {http://doi.acm.org/10.1145/1669112.1669161}
  2224. ,publisher = {ACM}
  2225. ,address = {New York, NY, USA}
  2226. ,annotation={
  2227. Uses RCU to protect metadata used in dynamic analysis.
  2228. }
  2229. }
  2230. @conference{PaulEMcKenney2010SimpleOptRCU
  2231. ,Author="Paul E. McKenney"
  2232. ,Title="Simplicity Through Optimization"
  2233. ,Booktitle="linux.conf.au 2010"
  2234. ,month="January"
  2235. ,year="2010"
  2236. ,address="Wellington, New Zealand"
  2237. ,note="Available:
  2238. \url{http://www.rdrop.com/users/paulmck/RCU/SimplicityThruOptimization.2010.01.21f.pdf}
  2239. [Viewed October 10, 2010]"
  2240. ,annotation={
  2241. TREE_PREEMPT_RCU optimizations greatly simplified the old
  2242. PREEMPT_RCU implementation.
  2243. }
  2244. }
  2245. @unpublished{PaulEMcKenney2010LockdepRCU
  2246. ,Author="Paul E. McKenney"
  2247. ,Title="Lockdep-{RCU}"
  2248. ,month="February"
  2249. ,year="2010"
  2250. ,day="1"
  2251. ,note="\url{https://lwn.net/Articles/371986/}"
  2252. ,annotation={
  2253. CONFIG_PROVE_RCU, or at least an early version.
  2254. [Viewed June 4, 2010]
  2255. }
  2256. }
  2257. @unpublished{AviKivity2010KVM2RCU
  2258. ,Author="Avi Kivity"
  2259. ,Title="[{PATCH} 37/40] {KVM}: Bump maximum vcpu count to 64"
  2260. ,month="February"
  2261. ,year="2010"
  2262. ,note="Available:
  2263. \url{http://www.mail-archive.com/kvm@vger.kernel.org/msg28640.html}
  2264. [Viewed March 20, 2010]"
  2265. ,annotation={
  2266. Use of RCU permits KVM to increase the size of guest OSes from
  2267. 16 CPUs to 64 CPUs.
  2268. }
  2269. }
  2270. @unpublished{HerbertXu2010RCUResizeHash
  2271. ,Author="Herbert Xu"
  2272. ,Title="bridge: Add core IGMP snooping support"
  2273. ,month="February"
  2274. ,year="2010"
  2275. ,note="Available:
  2276. \url{http://thread.gmane.org/gmane.linux.network/153338}
  2277. [Viewed June 9, 2014]"
  2278. ,annotation={
  2279. Use a pair of list_head structures to support RCU-protected
  2280. resizable hash tables.
  2281. }
  2282. }
  2283. @mastersthesis{AbhinavDuggal2010Masters
  2284. ,author="Abhinav Duggal"
  2285. ,title="Stopping Data Races Using Redflag"
  2286. ,school="Stony Brook University"
  2287. ,year="2010"
  2288. ,annotation={
  2289. Data-race detector incorporating RCU.
  2290. http://www.filesystems.org/docs/abhinav-thesis/abhinav_thesis.pdf
  2291. }
  2292. }
  2293. @article{JoshTriplett2010RPHash
  2294. ,author="Josh Triplett and Paul E. McKenney and Jonathan Walpole"
  2295. ,title="Scalable Concurrent Hash Tables via Relativistic Programming"
  2296. ,journal="ACM Operating Systems Review"
  2297. ,year=2010
  2298. ,volume=44
  2299. ,number=3
  2300. ,month="July"
  2301. ,annotation={
  2302. RP fun with hash tables.
  2303. http://portal.acm.org/citation.cfm?id=1842733.1842750
  2304. }
  2305. }
  2306. @unpublished{PaulEMcKenney2010RCUAPI
  2307. ,Author="Paul E. McKenney"
  2308. ,Title="The {RCU} {API}, 2010 Edition"
  2309. ,month="December"
  2310. ,day="8"
  2311. ,year="2010"
  2312. ,note="\url{http://lwn.net/Articles/418853/}"
  2313. ,annotation={
  2314. Includes updated software-engineering features.
  2315. [Viewed December 8, 2010]
  2316. }
  2317. }
  2318. @mastersthesis{AndrejPodzimek2010masters
  2319. ,author="Andrej Podzimek"
  2320. ,title="Read-Copy-Update for OpenSolaris"
  2321. ,school="Charles University in Prague"
  2322. ,year="2010"
  2323. ,note="Available:
  2324. \url{https://andrej.podzimek.org/thesis.pdf}
  2325. [Viewed January 31, 2011]"
  2326. ,annotation={
  2327. Reviews RCU implementations and creates a few for OpenSolaris.
  2328. Drives quiescent-state detection from RCU read-side primitives,
  2329. in a manner roughly similar to that of Jim Houston.
  2330. }
  2331. }
  2332. @unpublished{LinusTorvalds2011Linux2:6:38:rc1:NPigginVFS
  2333. ,Author="Linus Torvalds"
  2334. ,Title="Linux 2.6.38-rc1"
  2335. ,month="January"
  2336. ,year="2011"
  2337. ,note="Available:
  2338. \url{https://lkml.org/lkml/2011/1/18/322}
  2339. [Viewed March 4, 2011]"
  2340. ,annotation={
  2341. "The RCU-based name lookup is at the other end of the spectrum - the
  2342. absolute anti-gimmick. It's some seriously good stuff, and gets rid of
  2343. the last main global lock that really tends to hurt some kernel loads.
  2344. The dentry lock is no longer a big serializing issue. What's really
  2345. nice about it is that it actually improves performance a lot even for
  2346. single-threaded loads (on an SMP kernel), because it gets rid of some
  2347. of the most expensive parts of path component lookup, which was the
  2348. d_lock on every component lookup. So I'm seeing improvements of 30-50%
  2349. on some seriously pathname-lookup intensive loads."
  2350. }
  2351. }
  2352. @techreport{JoshTriplett2011RPScalableCorrectOrdering
  2353. ,author = {Josh Triplett and Philip W. Howard and Paul E. McKenney and Jonathan Walpole}
  2354. ,title = {Scalable Correct Memory Ordering via Relativistic Programming}
  2355. ,year = {2011}
  2356. ,number = {11-03}
  2357. ,institution = {Portland State University}
  2358. ,note = {\url{http://www.cs.pdx.edu/pdfs/tr1103.pdf}}
  2359. }
  2360. @inproceedings{PhilHoward2011RCUTMRBTree
  2361. ,author = {Philip W. Howard and Jonathan Walpole}
  2362. ,title = {A Relativistic Enhancement to Software Transactional Memory}
  2363. ,booktitle = {Proceedings of the 3rd USENIX conference on Hot topics in parallelism}
  2364. ,series = {HotPar'11}
  2365. ,year = {2011}
  2366. ,location = {Berkeley, CA}
  2367. ,pages = {1--6}
  2368. ,numpages = {6}
  2369. ,url = {http://www.usenix.org/event/hotpar11/tech/final_files/Howard.pdf}
  2370. ,publisher = {USENIX Association}
  2371. ,address = {Berkeley, CA, USA}
  2372. }
  2373. @techreport{PaulEMcKenney2011cyclicparallelRCU
  2374. ,author="Paul E. McKenney and Jonathan Walpole"
  2375. ,title="Efficient Support of Consistent Cyclic Search With Read-Copy Update and Parallel Updates"
  2376. ,institution="US Patent and Trademark Office"
  2377. ,address="Washington, DC"
  2378. ,year="2011"
  2379. ,number="US Patent 7,953,778"
  2380. ,month="May"
  2381. ,pages="34"
  2382. ,annotation={
  2383. Maintains an array of generation numbers to track in-flight
  2384. updates and keeps an additional level of indirection to allow
  2385. readers to confine themselves to the desired snapshot of the
  2386. data structure.
  2387. }
  2388. }
  2389. @inproceedings{Triplett:2011:RPHash
  2390. ,author = {Triplett, Josh and McKenney, Paul E. and Walpole, Jonathan}
  2391. ,title = {Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming}
  2392. ,booktitle = {Proceedings of the 2011 USENIX Annual Technical Conference}
  2393. ,month = {June}
  2394. ,year = {2011}
  2395. ,pages = {145--158}
  2396. ,numpages = {14}
  2397. ,url={http://www.usenix.org/event/atc11/tech/final_files/Triplett.pdf}
  2398. ,publisher = {The USENIX Association}
  2399. ,address = {Portland, OR USA}
  2400. }
  2401. @unpublished{PaulEMcKenney2011RCU3.0trainwreck
  2402. ,Author="Paul E. McKenney"
  2403. ,Title="3.0 and {RCU:} what went wrong"
  2404. ,month="July"
  2405. ,day="27"
  2406. ,year="2011"
  2407. ,note="\url{http://lwn.net/Articles/453002/}"
  2408. ,annotation={
  2409. Analysis of the RCU trainwreck in Linux kernel 3.0.
  2410. [Viewed July 27, 2011]
  2411. }
  2412. }
  2413. @unpublished{NeilBrown2011MeetTheLockers
  2414. ,Author="Neil Brown"
  2415. ,Title="Meet the {Lockers}"
  2416. ,month="August"
  2417. ,day="3"
  2418. ,year="2011"
  2419. ,note="Available:
  2420. \url{http://lwn.net/Articles/453685/}
  2421. [Viewed September 2, 2011]"
  2422. ,annotation={
  2423. The Locker family as an analogy for locking, reference counting,
  2424. RCU, and seqlock.
  2425. }
  2426. }
  2427. @inproceedings{Seyster:2011:RFA:2075416.2075425
  2428. ,author = {Seyster, Justin and Radhakrishnan, Prabakar and Katoch, Samriti and Duggal, Abhinav and Stoller, Scott D. and Zadok, Erez}
  2429. ,title = {Redflag: a framework for analysis of Kernel-level concurrency}
  2430. ,booktitle = {Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I}
  2431. ,series = {ICA3PP'11}
  2432. ,year = {2011}
  2433. ,isbn = {978-3-642-24649-4}
  2434. ,location = {Melbourne, Australia}
  2435. ,pages = {66--79}
  2436. ,numpages = {14}
  2437. ,url = {http://dl.acm.org/citation.cfm?id=2075416.2075425}
  2438. ,acmid = {2075425}
  2439. ,publisher = {Springer-Verlag}
  2440. ,address = {Berlin, Heidelberg}
  2441. }
  2442. @phdthesis{JoshTriplettPhD
  2443. ,author="Josh Triplett"
  2444. ,title="Relativistic Causal Ordering: A Memory Model for Scalable Concurrent Data Structures"
  2445. ,school="Portland State University"
  2446. ,year="2012"
  2447. ,annotation={
  2448. RCU-protected hash tables, barriers vs. read-side traversal order.
  2449. .
  2450. If the updater is making changes in the opposite direction from
  2451. the read-side traveral order, the updater need only execute a
  2452. memory-barrier instruction, but if in the same direction, the
  2453. updater needs to wait for a grace period between the individual
  2454. updates.
  2455. }
  2456. }
  2457. @article{MathieuDesnoyers2012URCU
  2458. ,Author="Mathieu Desnoyers and Paul E. McKenney and Alan Stern and Michel R. Dagenais and Jonathan Walpole"
  2459. ,Title="User-Level Implementations of Read-Copy Update"
  2460. ,journal="IEEE Transactions on Parallel and Distributed Systems"
  2461. ,volume={23}
  2462. ,year="2012"
  2463. ,issn="1045-9219"
  2464. ,pages="375-382"
  2465. ,doi="http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.159"
  2466. ,publisher="IEEE Computer Society"
  2467. ,address="Los Alamitos, CA, USA"
  2468. ,annotation={
  2469. RCU overview, desiderata, semi-formal semantics, user-level RCU
  2470. usage scenarios, three classes of RCU implementation, wait-free
  2471. RCU updates, RCU grace-period batching, update overhead,
  2472. http://www.rdrop.com/users/paulmck/RCU/urcu-main-accepted.2011.08.30a.pdf
  2473. http://www.rdrop.com/users/paulmck/RCU/urcu-supp-accepted.2011.08.30a.pdf
  2474. http://www.computer.org/cms/Computer.org/dl/trans/td/2012/02/extras/ttd2012020375s.pdf
  2475. }
  2476. }
  2477. @inproceedings{AustinClements2012RCULinux:mmapsem
  2478. ,author = {Austin Clements and Frans Kaashoek and Nickolai Zeldovich}
  2479. ,title = {Scalable Address Spaces Using {RCU} Balanced Trees}
  2480. ,booktitle = {Architectural Support for Programming Languages and Operating Systems (ASPLOS 2012)}
  2481. ,month = {March}
  2482. ,year = {2012}
  2483. ,pages = {199--210}
  2484. ,numpages = {12}
  2485. ,publisher = {ACM}
  2486. ,address = {London, UK}
  2487. ,url="http://people.csail.mit.edu/nickolai/papers/clements-bonsai.pdf"
  2488. }
  2489. @unpublished{PaulEMcKenney2012ELCbattery
  2490. ,Author="Paul E. McKenney"
  2491. ,Title="Making {RCU} Safe For Battery-Powered Devices"
  2492. ,month="February"
  2493. ,day="15"
  2494. ,year="2012"
  2495. ,note="Available:
  2496. \url{http://www.rdrop.com/users/paulmck/RCU/RCUdynticks.2012.02.15b.pdf}
  2497. [Viewed March 1, 2012]"
  2498. ,annotation={
  2499. RCU_FAST_NO_HZ, round 2.
  2500. }
  2501. }
  2502. @article{GuillermoVigueras2012RCUCrowd
  2503. ,author = {Vigueras, Guillermo and Ordu\~{n}a, Juan M. and Lozano, Miguel}
  2504. ,day = {25}
  2505. ,doi = {10.1007/s11227-012-0766-x}
  2506. ,issn = {0920-8542}
  2507. ,journal = {The Journal of Supercomputing}
  2508. ,keywords = {linux, simulation}
  2509. ,month = apr
  2510. ,posted-at = {2012-05-03 09:12:04}
  2511. ,priority = {2}
  2512. ,title = {{A Read-Copy Update based parallel server for distributed crowd simulations}}
  2513. ,url = {http://dx.doi.org/10.1007/s11227-012-0766-x}
  2514. ,year = {2012}
  2515. }
  2516. @unpublished{JonCorbet2012ACCESS:ONCE
  2517. ,Author="Jon Corbet"
  2518. ,Title="{ACCESS\_ONCE()}"
  2519. ,month="August"
  2520. ,day="1"
  2521. ,year="2012"
  2522. ,note="\url{http://lwn.net/Articles/508991/}"
  2523. ,annotation={
  2524. A couple of simple specific compiler optimizations that motivate
  2525. ACCESS_ONCE().
  2526. }
  2527. }
  2528. @unpublished{AlexeyGotsman2012VerifyGraceExtended
  2529. ,Author="Alexey Gotsman and Noam Rinetzky and Hongseok Yang"
  2530. ,Title="Verifying Highly Concurrent Algorithms with Grace (extended version)"
  2531. ,month="July"
  2532. ,day="10"
  2533. ,year="2012"
  2534. ,note="\url{http://software.imdea.org/~gotsman/papers/recycling-esop13-ext.pdf}"
  2535. ,annotation={
  2536. Separation-logic formulation of RCU uses.
  2537. }
  2538. }
  2539. @unpublished{PaulMcKenney2012RCUUsage
  2540. ,Author="Paul E. McKenney and Silas Boyd-Wickizer and Jonathan Walpole"
  2541. ,Title="{RCU} Usage In the Linux Kernel: One Decade Later"
  2542. ,month="September"
  2543. ,day="17"
  2544. ,year="2012"
  2545. ,url=http://rdrop.com/users/paulmck/techreports/survey.2012.09.17a.pdf
  2546. ,note="Technical report paulmck.2012.09.17"
  2547. ,annotation={
  2548. Overview of the first variant of no-CBs CPUs for RCU.
  2549. }
  2550. }
  2551. @unpublished{JonCorbet2012NOCB
  2552. ,Author="Jon Corbet"
  2553. ,Title="Relocating RCU callbacks"
  2554. ,month="October"
  2555. ,day="31"
  2556. ,year="2012"
  2557. ,note="\url{http://lwn.net/Articles/522262/}"
  2558. ,annotation={
  2559. Overview of the first variant of no-CBs CPUs for RCU.
  2560. }
  2561. }
  2562. @phdthesis{JustinSeyster2012PhD
  2563. ,author="Justin Seyster"
  2564. ,title="Runtime Verification of Kernel-Level Concurrency Using Compiler-Based Instrumentation"
  2565. ,school="Stony Brook University"
  2566. ,year="2012"
  2567. ,annotation={
  2568. Looking for data races, including those involving RCU.
  2569. Proposal:
  2570. http://www.fsl.cs.sunysb.edu/docs/jseyster-proposal/redflag.pdf
  2571. Dissertation:
  2572. http://www.fsl.cs.sunysb.edu/docs/jseyster-dissertation/redflag.pdf
  2573. }
  2574. }
  2575. @unpublished{PaulEMcKenney2013RCUUsage
  2576. ,Author="Paul E. McKenney and Silas Boyd-Wickizer and Jonathan Walpole"
  2577. ,Title="{RCU} Usage in the {Linux} Kernel: One Decade Later"
  2578. ,month="February"
  2579. ,day="24"
  2580. ,year="2013"
  2581. ,note="\url{http://rdrop.com/users/paulmck/techreports/RCUUsage.2013.02.24a.pdf}"
  2582. ,annotation={
  2583. Usage of RCU within the Linux kernel.
  2584. }
  2585. }
  2586. @inproceedings{AlexeyGotsman2013ESOPRCU
  2587. ,author = {Alexey Gotsman and Noam Rinetzky and Hongseok Yang}
  2588. ,title = {Verifying concurrent memory reclamation algorithms with grace}
  2589. ,booktitle = {ESOP'13: European Symposium on Programming}
  2590. ,year = {2013}
  2591. ,pages = {249--269}
  2592. ,publisher = {Springer}
  2593. ,address = {Rome, Italy}
  2594. ,annotation={
  2595. http://software.imdea.org/~gotsman/papers/recycling-esop13.pdf
  2596. }
  2597. }
  2598. @unpublished{PaulEMcKenney2013NoTinyPreempt
  2599. ,Author="Paul E. McKenney"
  2600. ,Title="Simplifying RCU"
  2601. ,month="March"
  2602. ,day="6"
  2603. ,year="2013"
  2604. ,note="\url{http://lwn.net/Articles/541037/}"
  2605. ,annotation={
  2606. Getting rid of TINY_PREEMPT_RCU.
  2607. }
  2608. }