-
Notifications
You must be signed in to change notification settings - Fork 17
/
perfbook.bbl
1686 lines (1425 loc) · 64.4 KB
/
perfbook.bbl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
\newcommand{\etalchar}[1]{$^{#1}$}
\begin{thebibliography}{EGMdB11}
\bibitem[AAKL06]{CScottAnanian2006}
C.~Scott Ananian, Krste Asanovic, Bradley~C. Kuszmaul, and Charles~E.
Leiserson.
\newblock Unbounded transactional memory.
\newblock {\em IEEE Micro}, pages 59--69, January-February 2006.
\newblock Available:
\url{http://www.cag.csail.mit.edu/scale/papers/utm-ieeemicro2006.pdf} [Viewed
December 21, 2006].
\bibitem[ABD{\etalchar{+}}97]{Anderson97}
Jennifer~M. Anderson, Lance~M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika~R.
Henzinger, Shun-Tak~A. Leung, Richard~L. Sites, Mark~T. Vandevoorde, Carl~A.
Waldspurger, and William~E. Weihl.
\newblock Continuous profiling: Where have all the cycles gone?
\newblock In {\em Proceedings of the 16\textsuperscript{th} ACM Symposium on
Operating Systems Principles}, pages 1--14, New York, NY, October 1997.
\bibitem[aCB08]{SETIatHOME2008}
University at~California~Berkeley.
\newblock {SETI}@{HOME}.
\newblock Available: \url{http://setiathome.berkeley.edu/} [Viewed January 31,
2008], December 2008.
\bibitem[ACMS03]{Arcangeli03}
Andrea Arcangeli, Mingming Cao, Paul~E. McKenney, and Dipankar Sarma.
\newblock Using read-copy update techniques for {System V IPC} in the {Linux}
2.5 kernel.
\newblock In {\em Proceedings of the 2003 USENIX Annual Technical Conference
(FREENIX Track)}, pages 297--310. USENIX Association, June 2003.
\bibitem[Adv02]{AMDOpteron02}
Advanced Micro Devices.
\newblock {\em AMD x86-64 Architecture Programmer's Manual Volumes 1-5}, 2002.
\bibitem[Adv07]{AMDOpteron:2:2007}
Advanced Micro Devices.
\newblock {\em AMD x86-64 Architecture Programmer's Manual Volume 2: System
Programming}, 2007.
\bibitem[AGH{\etalchar{+}}11]{HagitAttiya2011LawsOfOrder}
Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov, and Maged~M.
Michael.
\newblock Laws of order: Expensive synchronization in concurrent algorithms
cannot be eliminated.
\newblock In {\em 38\textsuperscript{th} ACM SIGACT-SIGPLAN Symposium on
Principles of Programming Languages}, New York, NY, USA, 2011. ACM.
\bibitem[Ale79]{Alexander79}
Christopher Alexander.
\newblock {\em The Timeless Way of Building}.
\newblock Oxford University Press, New York, 1979.
\bibitem[Amd67]{GeneAmdahl1967AmdahlsLaw}
Gene Amdahl.
\newblock Validity of the single processor approach to achieving large-scale
computing capabilities.
\newblock In {\em AFIPS Conference Proceedings}, pages 483--485, Washington,
DC, USA, 1967. IEEE Computer Society.
\bibitem[And90]{Anderson90}
T.~E. Anderson.
\newblock The performance of spin lock alternatives for shared-memory
multiprocessors.
\newblock {\em IEEE Transactions on Parallel and Distributed Systems},
1(1):6--16, January 1990.
\bibitem[And91]{Andrews91textbook}
Gregory~R. Andrews.
\newblock {\em Concurrent Programming, Principles, and Practices}.
\newblock Benjamin Cummins, 1991.
\bibitem[ARM10]{ARMv7A:2010}
ARM Limited.
\newblock {\em ARM Architecture Reference Manual: ARMv7-A and ARMv7-R Edition},
2010.
\bibitem[ATC{\etalchar{+}}11]{EgeAkpinar2011HTM2TLE}
Ege Akpinar, Sasa Tomic, Adrian Cristal, Osman Unsal, and Mateo Valero.
\newblock A comprehensive study of conflict resolution policies in hardware
transactional memory.
\newblock In {\em TRANSACT 2011}. ACM SIGPLAN, June 2011.
\bibitem[ATS09]{Ali-Reza-Adl-Tabatabai2009CppTM}
Ali-Reza Adl-Tabatabai and Tatiana Shpeisman.
\newblock Draft specification of transactional language constructs for c++.
\newblock
http://research.sun.com/scalable/pubs/C++-transactional-constructs-1.0.pdf,
August 2009.
\bibitem[BA01]{Bonwick01slab}
Jeff Bonwick and Jonathan Adams.
\newblock Magazines and vmem: Extending the slab allocator to many {CPUs} and
arbitrary resources.
\newblock In {\em {USENIX} Annual Technical Conference, General Track 2001},
pages 15--33, 2001.
\bibitem[BC05]{BovetCesati2005}
Daniel Bovet and Marco Cesati.
\newblock {\em Understanding the Linux Kernel}.
\newblock O'Reilly Media, Inc., third edition, 2005.
\bibitem[Bec11]{PeteBecker2011N3242}
Pete Becker.
\newblock Working draft, standard for programming language {C++}.
\newblock Available:
\url{http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3242.pdf}
[Viewed: April 3, 2011], February 2011.
\bibitem[BHG87]{PhilipABernstein1987}
Philip~A. Bernstein, Vassos Hadzilacos, and Nathan Goodman.
\newblock {\em Concurrency Control and Recovery in Database Systems}.
\newblock Addison Wesley Publishing Company, 1987.
\bibitem[BHS07]{BuschmannHenneySchmidt2007v4Textbook}
Frank Buschmann, Kevlin Henney, and Douglas~C. Schmidt.
\newblock {\em Pattern-Oriented Software Architecture Volume 4: A Pattern
Language for Distributed Computing}.
\newblock Wiley, Chichester, West Sussex, England, 2007.
\bibitem[BK85]{Beck85}
Bob Beck and Bob Kasten.
\newblock {VLSI} assist in building a multiprocessor {UNIX} system.
\newblock In {\em USENIX Conference Proceedings}, pages 255--275, Portland, OR,
June 1985. USENIX Association.
\bibitem[BLM05]{Blundell2005DebunkTM}
C.~Blundell, E.~C. Lewis, and M.~Martin.
\newblock Deconstructing transactional semantics: The subtleties of atomicity.
\newblock In {\em Annual Workshop on Duplicating, Deconstructing, and Debunking
(WDDD)}, June 2005.
\newblock Available:
\url{http://www.cis.upenn.edu/acg/papers/wddd05_atomic_semantics.pdf} [Viewed
June 4, 2009].
\bibitem[BLM06]{Blundell2006TMdeadlock}
C.~Blundell, E.~C. Lewis, and M.~Martin.
\newblock Subtleties of transactional memory and atomicity semantics.
\newblock {\em Computer Architecture Letters}, 5(2), 2006.
\newblock Available:
\url{http://www.cis.upenn.edu/acg/papers/cal06_atomic_semantics.pdf} [Viewed
June 4, 2009].
\bibitem[BMMM05]{LukeBrowning2005SimpleLockNUMAAware}
Luke Browning, Thomas Mathews, Paul~E. McKenney, and James Moody.
\newblock Apparatus, method, and computer program product for converting simple
locks in a multiprocessor system.
\newblock Technical Report US Patent 6,842,809, US Patent and Trademark Office,
Washington, DC, January 2005.
\bibitem[Boe09]{HansJBoehm2009HOTPAR}
Hans-J. Boehm.
\newblock Transactional memory should be an implementation technique, not a
programming interface.
\newblock In {\em HOTPAR 2009}, page~6, Berkeley, CA, USA, March 2009.
\newblock Available:
\url{http://www.usenix.org/event/hotpar09/tech/full_papers/boehm/boehm.pdf}
[Viewed May 24, 2009].
\bibitem[Bow06]{RichardBornat2006SheepGoats}
Maggie Bowman.
\newblock Dividing the sheep from the goats.
\newblock url={http://www.cs.kent.ac.uk/news/2006/RBornat/}, February 2006.
\bibitem[Bra07]{RegBraithwaite2007FizzBuzz}
Reg Braithwaite.
\newblock Don't overthink fizzbuzz.
\newblock
url={http://weblog.raganwald.com/2007/01/dont-overthink-fizzbuzz.html},
January 2007.
\bibitem[But97]{Butenhof1997pthreads}
David Butenhof.
\newblock {\em Programming with {POSIX} Threads}.
\newblock Addison-Wesley, Boston, MA, USA, 1997.
\bibitem[CBM{\etalchar{+}}08]{CalinCascaval2008tmtoy}
Calin Cascaval, Colin Blundell, Maged Michael, Harold~W. Cain, Peng Wu,
Stefanie Chiras, and Siddhartha Chatterjee.
\newblock Software transactional memory: Why is it only a research toy?
\newblock {\em ACM Queue}, September 2008.
\bibitem[CHP71]{Courtois71}
P.~J. Courtois, F.~Heymans, and D.~L. Parnas.
\newblock Concurrent control with ``readers'' and ``writers''.
\newblock {\em Communications of the {ACM}}, 14(10):667--668, October 1971.
\bibitem[Cli09]{CliffClick2009AzulHTM}
Cliff Click.
\newblock And now some hardware transactional memory comments...
\newblock
http://www.azulsystems.com/blog/cliff-click/2009-02-25-and-now-some-hardware%
-transactional-memory-comments, February 2009.
\bibitem[CLRS01]{ThomasHCorman2001Algorithms}
T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C.~Stein.
\newblock {\em Introduction to Algorithms, Second Edition}.
\newblock MIT electrical engineering and computer science series. MIT Press,
2001.
\bibitem[{Com}01]{Compaq01}
{Compaq Computer Corporation}.
\newblock Shared memory, threads, interprocess communication.
\newblock Available: \url{http://www.openvms.compaq.com/wizard/wiz_2637.html},
August 2001.
\bibitem[Cor04]{JonathanCorbet2004sparse}
Jonathan Corbet.
\newblock Finding kernel problems automatically.
\newblock \url{http://lwn.net/Articles/87538/}, June 2004.
\bibitem[Cor06a]{JonathanCorbet2006lockdep}
Jonathan Corbet.
\newblock The kernel lock validator.
\newblock Available: \url{http://lwn.net/Articles/185666/} [Viewed: March 26,
2010], May 2006.
\bibitem[Cor06b]{JonathanCorbet2006PriorityInheritance}
Jonathan Corbet.
\newblock Priority inheritance in the kernel.
\newblock Available: \url{http://lwn.net/Articles/178253/} [Viewed June 29,
2009], April 2006.
\bibitem[Cor08]{CorbetLWN}
Jonathan Corbet.
\newblock Linux weekly news.
\newblock Available: \url{http://lwn.net/} [Viewed November 26, 2008], November
2008.
\bibitem[Cor12]{JonCorbet2012ACCESS:ONCE}
Jon Corbet.
\newblock Access\_once().
\newblock Available: \url{http://lwn.net/Articles/508991/} [Viewed August 4,
2012], August 2012.
\bibitem[Cra94]{Craig93}
Travis Craig.
\newblock Building {FIFO} and priority-queuing spin locks from atomic swap.
\newblock Technical Report 93-02-02, University of Washington, Seattle,
Washington, February 1994.
\bibitem[CRKH05]{CorbetRubiniKroahHartman}
Jonathan Corbet, Alessandro Rubini, and Greg Kroah-Hartman.
\newblock {\em Linux Device Drivers}.
\newblock O'Reilly Media, Inc., third edition, 2005.
\bibitem[CSG99]{DavidECuller1999}
David~E. Culler, Jaswinder~Pal Singh, and Anoop Gupta.
\newblock {\em Parallel Computer Architecture: a Hardware/Software Approach}.
\newblock Morgan Kaufman, 1999.
\bibitem[Dat82]{Date82}
C.~J. Date.
\newblock {\em An Introduction to Database Systems}, volume~1.
\newblock Addison-Wesley Publishing Company, 1982.
\bibitem[DBA09]{SaeedDehnadi2009SheepGoats}
Saeed Dehnadi, Richard Bornat, and Ray Adams.
\newblock Meta-analysis of the effect of consistency on success in early
learning of programming.
\newblock In {\em PPIG 2009}, pages 1--13, University of Limerick, Ireland,
June 2009. Psychology of Programming Interest Group.
\bibitem[DCW{\etalchar{+}}11]{LukeDalessandro:2011:ASPLOS:HybridNOrecSTM:deque}
Luke Dalessandro, Francois Carouge, Sean White, Yossi Lev, Mark Moir,
Michael~L. Scott, and Michael~F. Spear.
\newblock Hybrid {NOrec}: A case study in the effectiveness of best effort
hardware transactional memory.
\newblock In {\em Proceedings of the 16th International Conference on
Architectural Support for Programming Languages and Operating Systems
(ASPLOS)}, ASPLOS '11, pages ???--???, New York, NY, USA, 2011. ACM.
\bibitem[DD09]{MathieuDesnoyers2009LFCollabSummit}
Mathieu Desnoyers and Michel~R. Dagenais.
\newblock Lttng, filling the gap between kernel instrumentation and a widely
usable kernel tracer.
\newblock Available:
\url{http://events.linuxfoundation.org/slides/lfcs09_desnoyers_paper.pdfSimi%
lar} [Viewed: August 28, 2011], April 2009.
\bibitem[Des09]{MathieuDesnoyers2009URCU}
Mathieu Desnoyers.
\newblock [{RFC} git tree] userspace {RCU} (urcu) for {Linux}.
\newblock \url{http://lttng.org/urcu}, February 2009.
\bibitem[DFGG11]{AleksandarDragovejic2011STMnotToy}
Aleksandar Dragovejic, Pascal Felber, Vincent Gramoli, and Rachid Guerraoui.
\newblock Why {STM} can be more than a research toy.
\newblock {\em Communications of the ACM}, pages 70--77, April 2011.
\bibitem[DHL{\etalchar{+}}08]{DaveDice2008TransactLockElision}
Dave Dice, Maurice Herlihy, Doug Lea, Yossi Lev, Victor Luchangco, Wayne
Mesard, Mark Moir, Kevin Moore, and Dan Nussbaum.
\newblock Applications of the adaptive transactional memory test platform.
\newblock In {\em 3\textsuperscript{rd} ACM SIGPLAN Workshop on Transactional
Computing}, pages 1--10, Salt Lake City, UT, USA, February 2008.
\bibitem[Dij65]{Dijkstra65a}
E.~W. Dijkstra.
\newblock Solution of a problem in concurrent programming control.
\newblock {\em Communications of the {ACM}}, 8(9):569, Sept 1965.
\bibitem[Dij71]{Dijkstra1971HOoSP}
Edsger~W. Dijkstra.
\newblock Hierarchical ordering of sequential processes.
\newblock {\em Acta Informatica}, 1(2):115--138, 1971.
\newblock Available:
\url{http://www.cs.utexas.edu/users/EWD/ewd03xx/EWD310.PDF} [Viewed January
13, 2008].
\bibitem[DLM{\etalchar{+}}10]{DavidDice:2010:SCA:HTM:deque}
Dave Dice, Yossi Lev, Virendra~J. Marathe, Mark Moir, Dan Nussbaum, and Marek
Oleszewski.
\newblock Simplifying concurrent algorithms by exploiting hardware
transactional memory.
\newblock In {\em Proceedings of the 22nd ACM symposium on Parallelism in
algorithms and architectures}, SPAA '10, pages 325--334, New York, NY, USA,
2010. ACM.
\bibitem[DLMN09]{DaveDice2009ASPLOSRockHTM}
Dave Dice, Yossi Lev, Mark Moir, and Dan Nussbaum.
\newblock Early experience with a commericial hardware transactional memory
implementation.
\newblock In {\em Fourteenth International Conference on Architectural Support
for Programming Languages and Operating Systems (ASPLOS '09)}, pages
157--168, Washington, DC, USA, March 2009.
\newblock Available:
\url{http://research.sun.com/scalable/pubs/ASPLOS2009-RockHTM.pdf} [Viewed
February 4, 2009].
\bibitem[DMS{\etalchar{+}}12]{MathieuDesnoyers2012URCU}
Mathieu Desnoyers, Paul~E. McKenney, Alan Stern, Michel~R. Dagenais, and
Jonathan Walpole.
\newblock User-level implementations of read-copy update.
\newblock {\em IEEE Transactions on Parallel and Distributed Systems},
23:375--382, 2012.
\bibitem[Dov90]{Dove90}
Ken~F. Dove.
\newblock A high capacity {TCP/IP} in parallel {STREAMS}.
\newblock In {\em UKUUG Conference Proceedings}, London, June 1990.
\bibitem[Dre11]{UlrichDrepper2011Futexes}
Ulrich Drepper.
\newblock Futexes are tricky.
\newblock Technical Report FAT2011, Red Hat, Inc., Raleigh, NC, USA, November
2011.
\bibitem[DSS06]{DaveDice2006DISC}
Dave Dice, Ori Shalev, and Nir Shavit.
\newblock Transactional locking {II}.
\newblock In {\em Proc. International Symposium on Distributed Computing}.
Springer Verlag, 2006.
\newblock Available:
\url{http://www.springerlink.com/content/5688h5q0w72r54x0/} [Viewed March 10,
2008].
\bibitem[EGCD03]{ElGhazawi2003UPC}
T.~A. El-Ghazawi, W.~W. Carlson, and J.~M. Draper.
\newblock {UPC} language specifications v1.1.
\newblock Available: \url{http://upc.gwu.edu} [Viewed September 19, 2008], May
2003.
\bibitem[EGMdB11]{LinuxKernelPerfWiki}
Stephane Eranian, Eric Gouriou, Tipp Moseley, and Willem de~Bruijn.
\newblock Linux kernel profiling with perf.
\newblock \url{https://perf.wiki.kernel.org/index.php/Tutorial}, June 2011.
\bibitem[Ell80]{Ellis80}
Carla~Schlatter Ellis.
\newblock Concurrent search and insertion in avl trees.
\newblock {\em IEEE Transactions on Computers}, C-29(9):811--817, September
1980.
\bibitem[ELLM07]{FaithEllen:2007:SNZI}
Faith Ellen, Yossi Lev, Victor Luchangco, and Mark Moir.
\newblock Snzi: scalable nonzero indicators.
\newblock In {\em Proceedings of the twenty-sixth annual ACM symposium on
Principles of distributed computing}, PODC '07, pages 13--22, New York, NY,
USA, 2007. ACM.
\bibitem[Eng68]{DouglasEngelbart1968}
Douglas Engelbart.
\newblock The demo.
\newblock Available:
\url{http://video.google.com/videoplay?docid=-8734787622017763097} [Viewed
November 28, 2008], December 1968.
\bibitem[ENS05]{RyanEccles2005HPCSNovice}
Ryan Eccles, Blair Nonneck, and Deborah~A. Stacey.
\newblock Exploring parallel programming knowledge in the novice.
\newblock In {\em HPCS '05: Proceedings of the 19th International Symposium on
High Performance Computing Systems and Applications}, pages 97--102,
Washington, DC, USA, 2005. IEEE Computer Society.
\bibitem[ES90]{MargaretAEllis1990Cplusplus}
Margaret~A. Ellis and Bjarne Stroustrup.
\newblock {\em The Annotated {C++} Reference Manual}.
\newblock Addison Wesley, 1990.
\bibitem[ES05]{RyanEccles2006HPCSNoviceNeeds}
Ryan Eccles and Deborah~A. Stacey.
\newblock Understanding the parallel programmer.
\newblock In {\em HPCS '05: Proceedings of the 19th International Symposium on
High Performance Computing Systems and Applications}, pages 156--160,
Washington, DC, USA, 2005. IEEE Computer Society.
\bibitem[Fel50]{Feller58}
W.~Feller.
\newblock {\em An Introduction to Probability Theory and its Applications}.
\newblock John Wiley, 1950.
\bibitem[FPB79]{Brooks79}
Jr. Frederick P.~Brooks.
\newblock {\em The Mythical Man-Month}.
\newblock Addison-Wesley, 1979.
\bibitem[FRK02]{HubertusFrancke2002Futex}
Hubertus Francke, Rusty Russell, and Matthew Kirkwood.
\newblock Fuss, futexes and furwocks: Fast userlevel locking in linux.
\newblock In {\em {Ottawa Linux Symposium}}, pages 479--495, June 2002.
\newblock Available:
\url{http://www.kernel.org/doc/ols/2002/ols2002-pages-479-495.pdf} [Viewed
May 22, 2011].
\bibitem[Gar90]{Garg90}
Arun Garg.
\newblock Parallel {STREAMS}: a multi-processor implementation.
\newblock In {\em USENIX Conference Proceedings}, pages 163--176, Berkeley CA,
February 1990. USENIX Association.
\bibitem[Gar07]{BryanGardiner2007}
Bryan Gardiner.
\newblock Idf: Gordon moore predicts end of moore's law (again).
\newblock Available:
\url{http://blog.wired.com/business/2007/09/idf-gordon-mo-1.html} [Viewed:
November 28, 2008], September 2007.
\bibitem[GC96]{Cheriton96a}
Michael Greenwald and David~R. Cheriton.
\newblock The synergy between non-blocking synchronization and operating system
structure.
\newblock In {\em Proceedings of the Second Symposium on Operating Systems
Design and Implementation}, pages 123--136, Seattle, WA, October 1996. USENIX
Association.
\bibitem[Gha95]{Gharachorloo95}
Kourosh Gharachorloo.
\newblock Memory consistency models for shared-memory multiprocessors.
\newblock Technical Report CSL-TR-95-685, Computer Systems Laboratory,
Departments of Electrical Engineering and Computer Science, Stanford
University, Stanford, CA, December 1995.
\newblock Available:
\url{http://www.hpl.hp.com/techreports/Compaq-DEC/WRL-95-9.pdf} [Viewed:
October 11, 2004].
\bibitem[GHJV95]{GOF95}
Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides.
\newblock {\em Design Patterns: Elements of Reusable Object-Oriented Software}.
\newblock Addison-Wesley, 1995.
\bibitem[GKAS99]{Gamsa99}
Ben Gamsa, Orran Krieger, Jonathan Appavoo, and Michael Stumm.
\newblock Tornado: Maximizing locality and concurrency in a shared memory
multiprocessor operating system.
\newblock In {\em {Proceedings of the 3\textsuperscript{rd} Symposium on
Operating System Design and Implementation}}, pages 87--100, New Orleans, LA,
February 1999.
\newblock
\url{http://www.usenix.org/events/osdi99/full_papers/gamsa/gamsa.pdf}.
\bibitem[GMTW08]{DinakarGuniguntala2008IBMSysJ}
D.~Guniguntala, P.~E. McKenney, J.~Triplett, and J.~Walpole.
\newblock The read-copy-update mechanism for supporting real-time applications
on shared-memory multiprocessor systems with {Linux}.
\newblock {\em IBM Systems Journal}, 47(2):221--236, May 2008.
\newblock \url{http://www.research.ibm.com/journal/sj/472/guniguntala.pdf}.
\bibitem[GPB{\etalchar{+}}07]{Goetz2007Textbook}
Brian Goetz, Tim Peierls, Joshua Bloch, Joseph Bowbeer, David Holmes, and Doug
Lea.
\newblock {\em Java: Concurrency in Practice}.
\newblock Addison Wesley, Upper Saddle River, NJ, USA, 2007.
\bibitem[Gra02]{JimGray2002SmokingHairyGolfBalls}
Jim Gray.
\newblock Super-servers: Commodity computer clusters pose a software challenge.
\newblock Available:
\url{http://research.microsoft.com/en-us/um/people/gray/papers/superservers(%
4t_computers).doc} [Viewed: June 23, 2004], April 2002.
\bibitem[Gri00]{ScottGriffen2000}
Scott Griffen.
\newblock Internet pioneers: Doug englebart.
\newblock Available: \url{http://www.ibiblio.org/pioneers/englebart.html}
[Viewed November 28, 2008], May 2000.
\bibitem[Gro01]{TheOpenGroup1997SUS}
The~Open Group.
\newblock Single {UNIX} specification.
\newblock \url{http://www.opengroup.org/onlinepubs/007908799/index.html}, July
2001.
\bibitem[Gro07]{DanGrossman2007TMGCAnalogy}
Dan Grossman.
\newblock The transactional memory / garbage collection analogy.
\newblock In {\em {OOPSLA '07: Proceedings of the 22nd annual ACM SIGPLAN
conference on Object oriented programming systems and applications}}, pages
695--706, New York, NY, USA, October 2007. ACM.
\newblock Available:
\url{http://www.cs.washington.edu/homes/djg/papers/analogy_oopsla07.pdf}
[Viewed December 19, 2008].
\bibitem[GT90]{Graunke90}
Gary Graunke and Shreekant Thakkar.
\newblock Synchronization algorithms for shared-memory multiprocessors.
\newblock {\em IEEE Computer}, 23(6):60--69, June 1990.
\bibitem[HCS{\etalchar{+}}05]{LorinHochstein2005SC}
Lorin Hochstein, Jeff Carver, Forrest Shull, Sima Asgari, and Victor Basili.
\newblock Parallel programmer productivity: A case study of novice parallel
programmers.
\newblock In {\em SC '05: Proceedings of the 2005 ACM/IEEE conference on
Supercomputing}, page~35, Washington, DC, USA, 2005. IEEE Computer Society.
\bibitem[Her90]{MauriceHerlihy90a}
Maurice~P. Herlihy.
\newblock A methodology for implementing highly concurrent data structures.
\newblock In {\em Proceedings of the 2nd ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming}, pages 197--206, March 1990.
\bibitem[Her05]{MauriceHerlihy2005-TM-manifesto.pldi}
Maurice Herlihy.
\newblock The transactional manifesto: software engineering and non-blocking
synchronization.
\newblock In {\em PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on
Programming language design and implementation}, pages 280--280, New York,
NY, USA, 2005. ACM Press.
\bibitem[HKLP12]{AndreasHaas2012FIFOisnt}
Andreas Haas, Christoph~M. Kirsch, Michael Lippautz, and Hannes Payer.
\newblock How {FIFO} is your concurrent {FIFO} queue?
\newblock In {\em Proceedings of the Workshop on Relaxing Synchronization for
Multicore and Manycore Scalability}, Tucson, AZ USA, October 2012.
\bibitem[HLM02]{HerlihyLM02}
Maurice Herlihy, Victor Luchangco, and Mark Moir.
\newblock The repeat offender problem: A mechanism for supporting
dynamic-sized, lock-free data structures.
\newblock In {\em Proceedings of 16\textsuperscript{th} International Symposium
on Distributed Computing}, pages 339--353, October 2002.
\bibitem[HM93]{Herlihy93a}
Maurice Herlihy and J.~Eliot~B. Moss.
\newblock Transactional memory: Architectural support for lock-free data
structures.
\newblock {\em The 20\textsuperscript{th} Annual International Symposium on
Computer Architecture}, pages 289--300, May 1993.
\bibitem[HMB06]{ThomasEHart2006a}
Thomas~E. Hart, Paul~E. McKenney, and Angela~Demke Brown.
\newblock Making lockless synchronization fast: Performance implications of
memory reclamation.
\newblock In {\em 20\textsuperscript{th} {IEEE} International Parallel and
Distributed Processing Symposium}, Rhodes, Greece, April 2006.
\newblock Available:
\url{http://www.rdrop.com/users/paulmck/RCU/hart_ipdps06.pdf} [Viewed April
28, 2008].
\bibitem[HMBW07]{ThomasEHart2007a}
Thomas~E. Hart, Paul~E. McKenney, Angela~Demke Brown, and Jonathan Walpole.
\newblock Performance of memory reclamation for lockless synchronization.
\newblock {\em J. Parallel Distrib. Comput.}, 67(12):1270--1285, 2007.
\bibitem[Hol03]{Holzmann03a}
Gerard~J. Holzmann.
\newblock {\em The {Spin} Model Checker: Primer and Reference Manual}.
\newblock Addison-Wesley, 2003.
\bibitem[HP95]{Hennessy95a}
John~L. Hennessy and David~A. Patterson.
\newblock {\em Computer Architecture: A Quantitative Approach}.
\newblock Morgan Kaufman, 1995.
\bibitem[HS08]{HerlihyShavit2008Textbook}
Maurice Herlihy and Nir Shavit.
\newblock {\em The Art of Multiprocessor Programming}.
\newblock Morgan Kaufmann, Burlington, MA, USA, 2008.
\bibitem[HW90]{Herlihy:1990:LCC:78969.78972}
Maurice~P. Herlihy and Jeannette~M. Wing.
\newblock Linearizability: a correctness condition for concurrent objects.
\newblock {\em ACM Trans. Program. Lang. Syst.}, 12(3):463--492, July 1990.
\bibitem[HW92]{WilsonCHsieh92a}
Wilson~C. Hsieh and William~E. Weihl.
\newblock Scalable reader-writer locks for parallel systems.
\newblock In {\em Proceedings of the 6\textsuperscript{th} International
Parallel Processing Symposium}, pages 216--230, Beverly Hills, CA, USA, March
1992.
\bibitem[HW11]{PhilHoward2011RCUTMRBTree}
Philip~W. Howard and Jonathan Walpole.
\newblock A relativistic enhancement to software transactional memory.
\newblock In {\em Proceedings of the 3rd USENIX conference on Hot topics in
parallelism}, HotPar'11, pages 1--6, Berkeley, CA, USA, 2011. USENIX
Association.
\bibitem[{IBM}94]{PowerPC94}
{IBM Microelectronics and Motorola}.
\newblock {\em PowerPC Microprocessor Family: The Programming Environments},
1994.
\bibitem[Inm85]{Inman85}
Jack Inman.
\newblock Implementing loosely coupled functions on tightly coupled engines.
\newblock In {\em USENIX Conference Proceedings}, pages 277--298, Portland, OR,
June 1985. USENIX Association.
\bibitem[{Int}92]{DIS9075SQL92}
{International Standards Organization}.
\newblock {\em Information Technology - Database Language {SQL}}.
\newblock ISO, 1992.
\newblock Available:
\url{http://www.contrib.andrew.cmu.edu/~shadow/sql/sql1992.txt} [Viewed
September 19, 2008].
\bibitem[{Int}02a]{IntelItanium02v3}
{Intel Corporation}.
\newblock {\em Intel Itanium Architecture Software Developer's Manual Volume 3:
Instruction Set Reference}, 2002.
\bibitem[{Int}02b]{IntelItanium02v2}
{Intel Corporation}.
\newblock {\em Intel Itanium Architecture Software Developer's Manual Volume 3:
System Architecture}, 2002.
\bibitem[{Int}04a]{IntelXeonV2b-96a}
{Intel Corporation}.
\newblock {\em IA-32 Intel Architecture Software Developer's Manual Volume 2B:
Instruction Set Reference, N-Z}, 2004.
\newblock Available:
\url{ftp://download.intel.com/design/Pentium4/manuals/25366714.pdf} [Viewed:
February 16, 2005].
\bibitem[{Int}04b]{IntelXeonV3-96a}
{Intel Corporation}.
\newblock {\em IA-32 Intel Architecture Software Developer's Manual Volume 3:
System Programming Guide}, 2004.
\newblock Available:
\url{ftp://download.intel.com/design/Pentium4/manuals/25366814.pdf} [Viewed:
February 16, 2005].
\bibitem[{Int}04c]{IBMzSeries04a}
{International Business Machines Corporation}.
\newblock {z/Architecture} principles of operation.
\newblock Available:
\url{http://publibz.boulder.ibm.com/epubs/pdf/dz9zr003.pdf} [Viewed: February
16, 2005], May 2004.
\bibitem[{Int}07]{Intelx86MemoryOrdering2007}
{Intel Corporation}.
\newblock {\em Intel 64 Architecture Memory Ordering White Paper}, 2007.
\newblock Available:
\url{http://developer.intel.com/products/processor/manuals/318147.pdf}
[Viewed: September 7, 2007].
\bibitem[{Int}11]{Intel64IA32v3A2011}
{Intel Corporation}.
\newblock {\em Intel 64 and IA-32 Architectures Software Developer’s Manual,
Volume 3A: System Programming Guide, Part 1}, 2011.
\newblock Available: \url{http://www.intel.com/Assets/PDF/manual/253668.pdf}
[Viewed: February 12, 2011].
\bibitem[Jac08]{MapReduce2008MIT}
Daniel Jackson.
\newblock {MapReduce} course.
\newblock Available: \url{https://sites.google.com/site/mriap2008/} [Viewed
January 3, 2013], January 2008.
\bibitem[Jia08]{LaiJiangshan2008NewClassicAlgorithm}
Lai Jiangshan.
\newblock [{RFC}][{PATCH}] rcu classic: new algorithm for callbacks-processing.
\newblock Available: \url{http://lkml.org/lkml/2008/6/2/539} [Viewed December
10, 2008], June 2008.
\bibitem[JMRR02]{BenJackson02}
Benedict~Joseph Jackson, Paul~E. McKenney, Ramakrishnan Rajamony, and
Ronald~Lynn Rockhold.
\newblock Scalable interruptible queue locks for shared-memory multiprocessor.
\newblock Technical Report US Patent 6,473,819, US Patent and Trademark Office,
Washington, DC, October 2002.
\bibitem[Joh77]{StephenJohnson1977lint}
Stephen Johnson.
\newblock Lint, a {C} program checker.
\newblock Computer Science Technical Report 65, Bell Laboratories, December
1977.
\bibitem[Kan96]{GerryKane96a}
Gerry Kane.
\newblock {\em {PA-RISC} 2.0 Architecture}.
\newblock Hewlett-Packard Professional Books, 1996.
\bibitem[KCH{\etalchar{+}}06]{SanjeevKumar2006}
Sanjeev Kumar, Michael Chu, Christopher~J. Hughes, Partha Kumar, and Anthony
Nguyen.
\newblock Hybrid transactional memory.
\newblock In {\em Proceedings of the ACM SIGPLAN 2006 Symposium on Principles
and Practice of Parallel Programming}. ACM SIGPLAN, 2006.
\newblock Available:
\url{http://www.cs.princeton.edu/~skumar/papers/ppopp06/ppopp06.pdf} [Viewed
December 21, 2006].
\bibitem[KL80]{Kung80}
H.~T. Kung and Q.~Lehman.
\newblock Concurrent manipulation of binary search trees.
\newblock {\em ACM Transactions on Database Systems}, 5(3):354--382, September
1980.
\bibitem[KLP12]{ChristophMKirsch2012FIFOisntTR}
Christoph~M. Kirsch, Michael Lippautz, and Hannes Payer.
\newblock Fast and scalable k-fifo queues.
\newblock Technical Report 2012-04, University of Salzburg, Salzburg, Austria,
June 2012.
\bibitem[Kni08]{JohnKnickerbocker2008:3DI}
John~U. Knickerbocker.
\newblock {3D} chip technology.
\newblock {\em IBM Journal of Research and Development}, 52(6), November 2008.
\newblock Available: \url{http://www.research.ibm.com/journal/rd52-6.html}
[Viewed: January 1, 2009].
\bibitem[Knu73]{Knuth73}
Donald Knuth.
\newblock {\em The Art of Computer Programming}.
\newblock Addison-Wesley, 1973.
\bibitem[KWS97]{Kontothanassis97a}
Leonidas Kontothanassis, Robert~W. Wisniewski, and Michael~L. Scott.
\newblock Scheduler-conscious synchronization.
\newblock {\em Communications of the {ACM}}, 15(1):3--40, January 1997.
\bibitem[LA94]{BengHongLim94}
Beng-Hong Lim and Anant Agarwal.
\newblock Reactive synchronization algorithms for multiprocessors.
\newblock 03/28/94 FTP hing.lcs.mit.edu /pub/papers/reactive.ps.Z, March 1994.
\bibitem[Lam74]{Lamport74a}
Leslie Lamport.
\newblock A new solution of {Dijkstra's} concurrent programming problem.
\newblock {\em Communications of the {ACM}}, 17(8):453--455, August 1974.
\bibitem[Lea97]{DougLea1997Textbook}
Doug Lea.
\newblock {\em Concurrent Programming in Java: Design Principles and Patterns}.
\newblock Addison Wesley Longman, Reading, MA, USA, 1997.
\bibitem[LLO09]{YossiLev2009SNZIrwlock}
Yossi Lev, Victor Luchangco, and Marek Olszewski.
\newblock Scalable reader-writer locks.
\newblock In {\em SPAA '09: Proceedings of the twenty-first annual symposium on
Parallelism in algorithms and architectures}, pages 101--110, New York, NY,
USA, 2009. ACM.
\bibitem[Loc02]{DougLocke2002a}
Doug Locke.
\newblock Priority inheritance: The real story.
\newblock Available:
\url{http://www.linuxdevices.com/articles/AT5698775833.html} [Viewed June 29,
2005], July 2002.
\bibitem[Lom77]{DBLomet1977SIGSOFT}
D.~B. Lomet.
\newblock Process structuring, synchronization, and recovery using atomic
actions.
\newblock {\em SIGSOFT Softw. Eng. Notes}, 2(2):128--137, 1977.
\newblock Available: \url{http://portal.acm.org/citation.cfm?id=808319#}
[Viewed June 27, 2008].
\bibitem[Lov05]{RobertLove2005}
Robert Love.
\newblock {\em Linux Kernel Development}.
\newblock Novell Press, second edition, 2005.
\bibitem[LR80]{Lampson1980Mesa}
Butler~W. Lampson and David~D. Redell.
\newblock Experience with processes and monitors in {Mesa}.
\newblock {\em Communications of the ACM}, 23(2):105--117, 1980.
\bibitem[LS86]{LaninShasha1986TSM}
Vladimir Lanin and Dennis Shasha.
\newblock A symmetric concurrent b-tree algorithm.
\newblock In {\em ACM '86: Proceedings of 1986 ACM Fall joint computer
conference}, pages 380--389, Los Alamitos, CA, USA, 1986. IEEE Computer
Society Press.
\bibitem[LS11]{YujieLiu2011ToxicTransactions}
Yujie Liu and Michael Spear.
\newblock Toxic transactions.
\newblock In {\em TRANSACT 2011}. ACM SIGPLAN, June 2011.
\bibitem[LSH02]{MichaelLyons02a}
Michael Lyons, Ed~Silha, and Bill Hay.
\newblock {PowerPC} storage model and {AIX} programming.
\newblock Available:
\url{http://www-106.ibm.com/developerworks/eserver/articles/powerpc.html}
[Viewed: January 31, 2005], August 2002.
\bibitem[MAK{\etalchar{+}}01]{McKenney01a}
Paul~E. McKenney, Jonathan Appavoo, Andi Kleen, Orran Krieger, Rusty Russell,
Dipankar Sarma, and Maneesh Soni.
\newblock Read-copy update.
\newblock In {\em {Ottawa Linux Symposium}}, July 2001.
\newblock Available:
\url{http://www.linuxsymposium.org/2001/abstracts/readcopy.php}
\url{http://www.rdrop.com/users/paulmck/RCU/rclock_OLS.2001.05.01c.pdf}
[Viewed June 23, 2004].
\bibitem[Mas92]{HMassalinPhD}
H.~Massalin.
\newblock {\em Synthesis: An Efficient Implementation of Fundamental Operating
System Services}.
\newblock PhD thesis, Columbia University, New York, NY, 1992.
\bibitem[MBM{\etalchar{+}}06]{KevinEMoore2006}
Kevin~E. Moore, Jayaram Bobba, Michelle~J. Moravan, Mark~D. Hill, and David~A.
Wood.
\newblock {LogTM}: Log-based transactional memory.
\newblock In {\em Proceedings of the 12\textsuperscript{th} Annual
International Symposium on High Performance Computer Architecture (HPCA-12)},
Washington, DC, USA, 2006. IEEE.
\newblock Available:
\url{http://www.cs.wisc.edu/multifacet/papers/hpca06_logtm.pdf} [Viewed
December 21, 2006].
\bibitem[McK96a]{McKenney95b}
Paul~E. McKenney.
\newblock {\em Pattern Languages of Program Design}, volume~2, chapter 31:
Selecting Locking Designs for Parallel Programs, pages 501--531.
\newblock Addison-Wesley, June 1996.
\newblock Available:
\url{http://www.rdrop.com/users/paulmck/scalability/paper/mutexdesignpat.pdf}
[Viewed February 17, 2005].
\bibitem[McK96b]{McKenney96a}
Paul~E. McKenney.
\newblock Selecting locking primitives for parallel programs.
\newblock {\em Communications of the {ACM}}, 39(10):75--82, October 1996.
\bibitem[McK03]{McKenney03a}
Paul~E. McKenney.
\newblock Using {RCU} in the {Linux} 2.5 kernel.
\newblock {\em Linux Journal}, 1(114):18--26, October 2003.
\newblock Available: \url{http://www.linuxjournal.com/article/6993} [Viewed
November 14, 2007].
\bibitem[McK04]{PaulEdwardMcKenneyPhD}
Paul~E. McKenney.
\newblock {\em Exploiting Deferred Destruction: An Analysis of Read-Copy-Update
Techniques in Operating System Kernels}.
\newblock PhD thesis, OGI School of Science and Engineering at Oregon Health
and Sciences University, 2004.
\bibitem[McK05a]{PaulMcKenney2005i}
Paul~E. McKenney.
\newblock Memory ordering in modern microprocessors, part {I}.
\newblock {\em Linux Journal}, 1(136):52--57, August 2005.
\newblock Available: \url{http://www.linuxjournal.com/article/8211}
\url{http://www.rdrop.com/users/paulmck/scalability/paper/ordering.2007.09.1%
9a.pdf} [Viewed November 30, 2007].
\bibitem[McK05b]{PaulMcKenney2005j}
Paul~E. McKenney.
\newblock Memory ordering in modern microprocessors, part {II}.
\newblock {\em Linux Journal}, 1(137):78--82, September 2005.
\newblock Available: \url{http://www.linuxjournal.com/article/8212}
\url{http://www.rdrop.com/users/paulmck/scalability/paper/ordering.2007.09.1%
9a.pdf} [Viewed November 30, 2007].
\bibitem[McK05c]{PaulMcKenney2005d}
Paul~E. McKenney.
\newblock Re: [fwd: Re: [patch] real-time preemption,
-rt-2.6.13-rc4-v0.7.52-01].
\newblock Available: \url{http://lkml.org/lkml/2005/8/8/108} [Viewed March 14,
2006], August 2005.
\bibitem[McK05d]{PaulMcKenney2005h}
Paul~E. McKenney.
\newblock A realtime preemption overview.
\newblock Available: \url{http://lwn.net/Articles/146861/} [Viewed August 22,
2005], August 2005.
\bibitem[McK06a]{PaulEMcKenneyRCUusagePage}
Paul~E. McKenney.
\newblock {RCU} {Linux} usage.
\newblock Available:
\url{http://www.rdrop.com/users/paulmck/RCU/linuxusage.html} [Viewed January
14, 2007], October 2006.
\bibitem[McK06b]{PaulEMcKenney2006c}
Paul~E. McKenney.
\newblock Sleepable {RCU}.
\newblock Available: \url{http://lwn.net/Articles/202847/} Revised:
\url{http://www.rdrop.com/users/paulmck/RCU/srcu.2007.01.14a.pdf} [Viewed
August 21, 2006], October 2006.
\bibitem[McK07a]{PaulEMcKenney2007PreemptibleRCU}
Paul~E. McKenney.
\newblock The design of preemptible read-copy-update.
\newblock Available: \url{http://lwn.net/Articles/253651/} [Viewed October 25,
2007], October 2007.
\bibitem[McK07b]{PaulMcKenney2007QRCUpatch}
Paul~E. McKenney.
\newblock {[PATCH]} {QRCU} with lockless fastpath.
\newblock Available: \url{http://lkml.org/lkml/2007/2/25/18} [Viewed March 27,
2008], February 2007.
\bibitem[McK07c]{PaulEMcKenney2007PreemptibleRCUPatch}
Paul~E. McKenney.
\newblock [patch rfc 0/9] {RCU}: Preemptible {RCU}.
\newblock Available: \url{http://lkml.org/lkml/2007/9/10/213} [Viewed October
25, 2007], September 2007.
\bibitem[McK07d]{PaulEMcKenney2007BoostRCU}
Paul~E. McKenney.
\newblock Priority-boosting {RCU} read-side critical sections.
\newblock \url{http://lwn.net/Articles/220677/}, February 2007.
\bibitem[McK07e]{PaulEMcKenney2007rcubarrier}
Paul~E. McKenney.
\newblock {RCU} and unloadable modules.
\newblock Available: \url{http://lwn.net/Articles/217484/} [Viewed November 22,
2007], January 2007.
\bibitem[McK07f]{PaulEMcKenney2007QRCUspin}
Paul~E. McKenney.
\newblock Using {Promela} and {Spin} to verify parallel algorithms.
\newblock Available: \url{http://lwn.net/Articles/243851/} [Viewed September 8,
2007], August 2007.
\bibitem[McK07g]{PaulEMcKenney2007whatisRCU}
Paul~E. McKenney.
\newblock What is {RCU}?
\newblock Available:
\url{http://www.rdrop.com/users/paulmck/RCU/whatisRCU.html} [Viewed July 6,
2007], 07 2007.
\bibitem[McK08a]{PaulEMcKenney2008HierarchicalRCU}
Paul~E. McKenney.
\newblock Hierarchical {RCU}.
\newblock Available: \url{http://lwn.net/Articles/305782/} [Viewed November 6,
2008], November 2008.
\bibitem[McK08b]{PaulEMcKenney2008WhatIsRCUAPI}
Paul~E. McKenney.
\newblock {RCU} part 3: the {RCU} {API}.
\newblock Available: \url{http://lwn.net/Articles/264090/} [Viewed January 10,
2008], January 2008.
\bibitem[McK08c]{PaulEMcKenney2008WhatIsRCUUsage}
Paul~E. McKenney.
\newblock What is {RCU}? part 2: Usage.
\newblock Available: \url{http://lwn.net/Articles/263130/} [Viewed January 4,
2008], January 2008.
\bibitem[McK09a]{PaulEMcKenney2009HuntingHeisenbugs}
Paul~E. McKenney.
\newblock Hunting heisenbugs.
\newblock Available: \url{http://paulmck.livejournal.com/14639.html} [Viewed
June 4, 2010], November 2009.
\bibitem[McK09b]{PaulEMcKenney2009LWNBloatWatchRCU}
Paul~E. McKenney.
\newblock {RCU}: The {Bloatwatch} edition.
\newblock Available: \url{http://lwn.net/Articles/323929/} [Viewed March 20,
2009], March 2009.
\bibitem[McK09c]{PaulEMcKenney2009BloatwatchRCU}
Paul~E. McKenney.
\newblock Re: [patch fyi] rcu: the bloatwatch edition.
\newblock Available: \url{http://lkml.org/lkml/2009/1/14/449} [Viewed January
15, 2009], January 2009.
\bibitem[McK09d]{PaulEMcKenney2009TMeverywhere}
Paul~E. McKenney.
\newblock Transactional memory everywhere?
\newblock
\url{http://paulmck.livejournal.com/tag/transactional%20memory%20everywhere},
September 2009.
\bibitem[McK10]{PaulEMcKenney2010LockdepRCU}
Paul~E. McKenney.
\newblock Lockdep-{RCU}.
\newblock \url{https://lwn.net/Articles/371986/}, February 2010.
\bibitem[McK11a]{PaulEMcKenney2011RCU3.0trainwreck}