Is Parallel Programming Hard, And, If So, What Can You Do About It?

More documents

Recommendations

Info

$TeX op Mac OS X, met teTeX en TeXShop - Nluug$

206 APPENDIX D. READ-COPY UPDATE IMPLEMENTATIONS1 #define MAX_RCU_LVLS 32 #define RCU_FANOUT (CONFIG_RCU_FANOUT)3 #define RCU_FANOUT_SQ (RCU_FANOUT * RCU_FANOUT)4 #define RCU_FANOUT_CUBE (RCU_FANOUT_SQ * RCU_FANOUT)56 #if NR_CPUS
D.3. HIERARCHICAL RCU CODE WALKTHROUGH 207the leaf level is computed by dividing NR_CPUS byRCU_FANOUT, rounding up. The number of nodesat other levels is computed in a similar manner,but using (for example) RCU_FANOUT_SQ instead ofRCU_FANOUT.Line 28 then sums up all of the levels, resultingin the number of rcu_node structures plus the numberof rcu_data structures. Finally, line 29 subtractsNR_CPUS (which is the number of rcu_datastructures) from the sum, resulting in the numberof rcu_node structures, which is retained inNUM_RCU_NODES. This value is then used to size the->nodes array in the rcu_state structure.D.3.2 External InterfacesRCU’s external interfaces include not justthe standard RCU API, but also the internalinterfaces to the rest of the kernel thatare required for the RCU implementation itself.The interfaces are rcu_read_lock()),rcu_read_unlock()), rcu_read_lock_bh()),rcu_read_unlock_bh()), call_rcu() (which is awrapper around __call_rcu()), call_rcu_bh()(ditto), rcu_check_callbacks(), rcu_process_callbacks() (which is a wrapper around__rcu_process_callbacks(), rcu_pending()(which is a wrapper around __rcu_pending()),rcu_needs_cpu(), rcu_cpu_notify(), and__rcu_init(). Note that synchronize_rcu()and rcu_barrier() are common to all RCUimplementations, and are defined in terms ofcall_rcu(). Similarly, rcu_barrier_bh() iscommon to all RCU implementations and is definedin terms of call_rcu_bh().These external AP<strong>Is</strong> are each described in the followingsections.D.3.2.1 Read-Side Critical SectionsFigure D.21 shows the functions that demark RCUread-side critical sections. Lines 1-6 show __rcu_read_lock(), which begins an “rcu” read-side criticalsection. line 3 disables preemption, line 4 is asparse marker noting the beginning of an RCU readsidecriticalsection,andline5updateslockdepstate.Lines 8-13 show __rcu_read_unlock(), which isthe inverse of __rcu_read_lock(). Lines 15-20show __rcu_read_lock_bh() and lines 22-27 show__rcu_read_unlock_bh(), which are analogous tothe previous two functions, but disable and enablebottom-half processing rather than preemption.Quick Quiz D.27: I thought that RCU read-sideprocessing was supposed to be fast!!! The functions1 void __rcu_read_lock(void)2 {3 preempt_disable();4 __acquire(RCU);5 rcu_read_acquire();6 }78 void __rcu_read_unlock(void)9 {10 rcu_read_release();11 __release(RCU);12 preempt_enable();13 }1415 void __rcu_read_lock_bh(void)16 {17 local_bh_disable();18 __acquire(RCU_BH);19 rcu_read_acquire();20 }2122 void __rcu_read_unlock_bh(void)23 {24 rcu_read_release();25 __release(RCU_BH);26 local_bh_enable();27 }Figure D.21: RCU Read-Side Critical Sectionsshown in Figure D.21 have so much junk in themthat they just have to be slow!!! <strong>What</strong> gives here?D.3.2.2 call rcu()Figure D.22 shows the code for __call_rcu(),call_rcu(), and call_rcu_bh(). Note that call_rcu() and call_rcu_bh() are simple wrappers forcall_rcu(), and thus will not be considered furtherhere.Turningattentionto__call_rcu(), lines9-10initializethe specified rcu_head, and line 11 ensuresthat updates to RCU-protected data structures carriedout prior to invoking __call_rcu() are seenprior to callback registry. Lines 12 and 34 disableandre-enableinterruptstopreventdestructiveinterferenceby any calls to __call_rcu() from an interrupthandler. Line 13 obtains a reference to the currentCPU’srcu_data structure, line 14 invokesrcu_process_gp_end() in order to advance callbacks ifthecurrentgraceperiodhasnowended, whileline15invokes check_for_new_grace_period() to recordstate if a new grace period has started.Quick Quiz D.28: Why not simply use __get_cpu_var() to pick up a reference to the currentCPU’srcu_datastructureonline13inFigureD.22?Lines 16 and 17 enqueue the new callback. Lines18 and 19 check to see there is a grace periodin progress, and, if not, line 23 acquires the rootrcu_node structure’s lock and line 24 invokes rcu_
Page 1 and 2:
Is Parallel Programming Hard, And,
Page 3 and 4:
Contents1 Introduction 11.1 Histori
Page 5 and 6:
CONTENTSv6 Locking 676.1 Staying Al
Page 7 and 8:
CONTENTSviiB Synchronization Primit
Page 9 and 10:
CONTENTSixE.7.1 Introduction to Pre
Page 11 and 12:
PrefaceThe purpose of this book is
Page 13 and 14:
Chapter 1IntroductionParallel progr
Page 15 and 16:
1.2. PARALLEL PROGRAMMING GOALS 3CP
Page 17 and 18:
1.3. ALTERNATIVES TO PARALLEL PROGR
Page 19 and 20:
1.4. WHAT MAKES PARALLEL PROGRAMMIN
Page 21 and 22:
1.5. GUIDE TO THIS BOOK 9other hand
Page 23 and 24:
Chapter 2Hardware and its HabitsMos
Page 25:
2.1. OVERVIEW 13Therefore, as shown
Page 28 and 29:
16 CHAPTER 2. HARDWARE AND ITS HABI
Page 30 and 31:
18 CHAPTER 2. HARDWARE AND ITS HABI
Page 32 and 33:
20 CHAPTER 3. TOOLS OF THE TRADE1 p
Page 34 and 35:
22 CHAPTER 3. TOOLS OF THE TRADE1 p
Page 36 and 37:
24 CHAPTER 3. TOOLS OF THE TRADE1.1
Page 38 and 39:
26 CHAPTER 3. TOOLS OF THE TRADEQui
Page 40 and 41:
28 CHAPTER 3. TOOLS OF THE TRADE
Page 42 and 43:
30 CHAPTER 4. COUNTING1 atomic_t co
Page 44 and 45:
32 CHAPTER 4. COUNTING4.2.3 Eventua
Page 46 and 47:
34 CHAPTER 4. COUNTINGvanish when t
Page 48 and 49:
36 CHAPTER 4. COUNTINGper-thread va
Page 50 and 51:
38 CHAPTER 4. COUNTING1 unsigned lo
Page 52 and 53:
Page 54 and 55:
42 CHAPTER 4. COUNTING1 #define THE
Page 56 and 57:
Page 58 and 59:
46 CHAPTER 4. COUNTINGReadsAlgorith
Page 60 and 61:
48 CHAPTER 5. PARTITIONING AND SYNC
Page 62 and 63:
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
Page 72 and 73:
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 80 and 81:
68 CHAPTER 6. LOCKING1 int delete(i
Page 82 and 83:
70 CHAPTER 7. DATA OWNERSHIP
Page 84 and 85:
72 CHAPTER 8. DEFERRED PROCESSINGfo
Page 86 and 87:
74 CHAPTER 8. DEFERRED PROCESSINGth
Page 88 and 89:
76 CHAPTER 8. DEFERRED PROCESSING
Page 90 and 91:
78 CHAPTER 8. DEFERRED PROCESSINGfi
Page 92 and 93:
80 CHAPTER 8. DEFERRED PROCESSINGti
Page 94 and 95:
82 CHAPTER 8. DEFERRED PROCESSINGNo
Page 96 and 97:
84 CHAPTER 8. DEFERRED PROCESSING12
Page 98 and 99:
Page 100 and 101:
88 CHAPTER 8. DEFERRED PROCESSINGvo
Page 102 and 103:
90 CHAPTER 8. DEFERRED PROCESSINGLi
Page 104 and 105:
92 CHAPTER 8. DEFERRED PROCESSINGpe
Page 106 and 107:
94 CHAPTER 8. DEFERRED PROCESSINGCa
Page 108 and 109:
96 CHAPTER 8. DEFERRED PROCESSINGTh
Page 110 and 111:
Page 112 and 113:
Page 114 and 115:
Page 116 and 117:
104 CHAPTER 8. DEFERRED PROCESSINGs
Page 118 and 119:
106 CHAPTER 8. DEFERRED PROCESSINGo
Page 120 and 121:
108 CHAPTER 8. DEFERRED PROCESSING
Page 122 and 123:
110 CHAPTER 9. APPLYING RCU1 struct
Page 124 and 125:
112 CHAPTER 9. APPLYING RCU
Page 126 and 127:
114 CHAPTER 10. VALIDATION: DEBUGGI
Page 128 and 129:
116 CHAPTER 11. DATA STRUCTURES
Page 130 and 131:
118 CHAPTER 12. ADVANCED SYNCHRONIZ
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Page 144 and 145:
Page 146 and 147:
Page 148 and 149:
Page 150 and 151:
138 CHAPTER 13. EASE OF USEFigure 1
Page 152 and 153:
140 CHAPTER 13. EASE OF USE
Page 154 and 155:
142 CHAPTER 14. TIME MANAGEMENT
Page 156 and 157:
144 CHAPTER 15. CONFLICTING VISIONS
Page 158 and 159:
Page 160 and 161:
Page 162 and 163:
Page 164 and 165:
Page 166 and 167:
154 APPENDIX A. IMPORTANT QUESTIONS
Page 168 and 169: 156 APPENDIX A. IMPORTANT QUESTIONS
Page 170 and 171: 158 APPENDIX B. SYNCHRONIZATION PRI
Page 172 and 173: 160 APPENDIX B. SYNCHRONIZATION PRI
Page 174 and 175: 162 APPENDIX C. WHY MEMORY BARRIERS
Page 196 and 197: 184 APPENDIX D. READ-COPY UPDATE IM
Page 256 and 257: 244 APPENDIX E. FORMAL VERIFICATION
Page 268 and 269:
256 APPENDIX E. FORMAL VERIFICATION
Page 270 and 271:
Page 272 and 273:
Page 274 and 275:
Page 276 and 277:
Page 278 and 279:
Page 280 and 281:
Page 282 and 283:
Page 284 and 285:
272 APPENDIX F. ANSWERS TO QUICK QU
Page 286 and 287:
Page 288 and 289:
Page 290 and 291:
Page 292 and 293:
Page 294 and 295:
Page 296 and 297:
Page 298 and 299:
Page 300 and 301:
Page 302 and 303:
Page 304 and 305:
Page 306 and 307:
Page 308 and 309:
Page 310 and 311:
Page 312 and 313:
Page 314 and 315:
Page 316 and 317:
Page 318 and 319:
Page 320 and 321:
Page 322 and 323:
Page 324 and 325:
Page 326 and 327:
Page 328 and 329:
Page 330 and 331:
Page 332 and 333:
Page 334 and 335:
Page 336 and 337:
Page 338 and 339:
Page 340 and 341:
Page 342 and 343:
330 APPENDIX G. GLOSSARY(2) A physi
Page 344 and 345:
332 APPENDIX G. GLOSSARYnear by. Th
Page 346 and 347:
334 APPENDIX G. GLOSSARY
Page 348 and 349:
336 BIBLIOGRAPHY[But97]USA, March 2
Page 350 and 351:
338 BIBLIOGRAPHY[HMB06][Hol03][HP95
Page 352 and 353:
340 BIBLIOGRAPHY[McK06] Paul E. McK
Page 354 and 355:
342 BIBLIOGRAPHYtor. Software - Pra
Page 356 and 357:
344 BIBLIOGRAPHY[UoC08][VGS08]Berke
Page 358:
346 APPENDIX H. CREDITSH.4 Original
show all

Is Parallel Programming Hard, And, If So, What Can You Do About It?

Create successful ePaper yourself

Delete template?

Save as template?