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$

90 CHAPTER 8. DEFERRED PROCESSINGLines 7-16 define the nmi_profile() function,which is called from within an NMI handler. Assuch, it cannot be preempted, nor can it be interruptedby a normal irq handler, however, it is stillsubject to delays due to cache misses, ECC errors,and cycle stealing by other hardware threads withinthe same core. Line 9 gets a local pointer to the profilebufferusingthercu_dereference()primitivetoensurememoryorderingonDECAlpha, andlines11and 12 exit from this function if there is no profilebuffer currently allocated, while lines 13 and 14 exitfrom this function if the pcvalue argument is outof range. Otherwise, line 15 increments the profilebufferentryindexedbythepcvalueargument.Notethat storing the size with the buffer guarantees thatthe range check matches the buffer, even if a largebuffer is suddenly replaced by a smaller one.Lines 18-27 define the nmi_stop() function,where the caller is responsible for mutual exclusion(for example, holding the correct lock). Line 20fetches a pointer to the profile buffer, and lines 22and 23 exit the function if there is no buffer.Otherwise, line 24 NULLs out the profile-bufferpointer (using the rcu_assign_pointer() primitiveto maintain memory ordering on weakly orderedmachines),andline25waitsforanRCUSchedgrace period to elapse, in particular, waiting forall non-preemptible regions of code, including NMIhandlers, to complete. Once execution continuesat line 26, we are guaranteed that any instance ofnmi_profile() that obtained a pointer to the oldbuffer has returned. It is therefore safe to free thebuffer, in this case using the kfree() primitive.Quick Quiz 8.21: Suppose that the nmi_profile() function was preemptible. What wouldneedtochangetomakethisexampleworkcorrectly?Inshort, RCUmakesiteasytodynamicallyswitchamong profile buffers (you just try doing this efficientlywith atomic operations, or at all with locking!).However, RCU is normally used at a higherlevel of abstraction, as was shown in the previoussections.8.3.2.8 RCU Usage SummaryAt its core, RCU is nothing more nor less than anAPI that provides:1. a publish-subscribe mechanism for adding newdata,2. a way of waiting for pre-existing RCU readersto finish, and3. a discipline of maintaining multiple versions topermit change without harming or unduly delayingconcurrent RCU readers.That said, it is possible to build higher-level constructson top of RCU, including the reader-writerlocking,reference-counting, and existence-guaranteeconstructs listed in the earlier sections. Furthermore,I have no doubt that the Linux communitywill continue to find interesting new uses for RCU,as well as for any of a number of other synchronizationprimitives.8.3.3 RCU Linux-Kernel APIThis section looks at RCU from the viewpoint ofits Linux-kernel API. Section 8.3.3.1 presents RCU’swait-to-finish APIs, and Section 8.3.3.2 presentsRCU’s publish-subscribe and version-maintenanceAPIs. Finally, Section 8.3.3.4 presents concludingremarks.8.3.3.1 RCU has a Family of Wait-to-FinishAPIsThe most straightforward answer to “what is RCU”is that RCU is an API used in the Linux kernel, assummarized by Tables 8.4 and 8.5, which shows thewait-for-RCU-readers portions of the non-sleepableand sleepable APIs, respectively, and by Table 8.6,which shows the publish/subscribe portions of theAPI.If you are new to RCU, you might consider focusingon just one of the columns in Table 8.4, each ofwhich summarizes one member of the Linux kernel’sRCU API family.. For example, if you are primarilyinterested in understanding how RCU is used in theLinux kernel, “RCU Classic” would be the place tostart, as it is used most frequently. On the otherhand, if you want to understand RCU for its ownsake, “SRCU” has the simplest API. You can alwayscome back for the other columns later.If you are already familiar with RCU, these tablescan serve as a useful reference.Quick Quiz 8.22: Why do some of the cells inTable 8.4 have exclamation marks (“!”)?The “RCU Classic” column corresponds to theoriginal RCU implementation, in which RCU readsidecritical sections are delimited by rcu_read_lock() and rcu_read_unlock(), which may benested. The corresponding synchronous update-sideprimitives, synchronize_rcu(), along with its synonymsynchronize_net(), wait for any currentlyexecuting RCU read-side critical sections to complete.The length of this wait is known as a “grace
8.3. READ-COPY UPDATE (RCU) 91Attribute RCU Classic RCU BH RCU Sched Realtime RCUPurpose Original Prevent DDoS attacks Wait for preemptdisableRealtime responseregions,hardirqs, & NMIsAvailability 2.5.43 2.6.9 2.6.12 2.6.26Read-side primitives rcu_read_lock() !rcu_read_unlock() !rcu_read_lock_bh()rcu_read_unlock_bh()preempt_disable()preempt_enable()rcu_read_lock()rcu_read_unlock()(and friends)Update-side primitives(synchronous)synchronize_rcu()synchronize_net()synchronize_sched() synchronize_rcu()synchronize_net()Update-side primitivescall_rcu() ! call_rcu_bh() call_rcu_sched() call_rcu()(asyn-chronous/callback)Table 8.4: RCU Wait-to-Finish APIsAttribute SRCU QRCUUpdate-side primitives rcu_barrier() rcu_barrier_bh() rcu_barrier_sched() rcu_barrier()(wait for callbacks)Type-safe memory SLAB_DESTROY_BY_RCU SLAB_DESTROY_BY_RCURead side constraints No blocking No irq enabling No blocking Only preemptionand lock acquisitionRead side overhead Preempt disable/enableBH disable/enable Preempt dis-Simple instructions,(freeable/enable (free irq disable/enableon non-PREEMPT)on non-PREEMPT)Asynchronous updatesidesub-microsecond sub-microsecond sub-microsecondoverheadGrace-period latency 10s of milliseconds 10s of milliseconds 10s of milliseconds 10s of millisecondsNon-PREEMPT_RT implementationRCU Classic RCU BH RCU Classic Preemptable RCUPREEMPT_RT implementationPreemptable RCU Realtime RCU Forced Schedule onall CPUsRealtime RCUPurpose Sleeping readers Sleeping readers and fast graceperiodsAvailability 2.6.19Read-side primitives srcu_read_lock()srcu_read_unlock()qrcu_read_lock()qrcu_read_unlock()Update-side primitives synchronize_srcu() synchronize_qrcu()(synchronous)Update-side primitivesN/AN/A(asyn-chronous/callback)Update-side primitives N/AN/A(wait for callbacks)Type-safe memoryRead side constraints No synchronize_srcu() No synchronize_qrcu()Read side overhead Simple instructions, preemptdisable/enableAtomic increment and decrementof shared variableAsynchronous updatesideN/AN/AoverheadGrace-period latency 10s of milliseconds 10s of nanoseconds in absenceof readersNon-PREEMPT_RT implementationSRCUN/APREEMPT_RT implementationSRCUN/ATable 8.5: Sleepable RCU Wait-to-Finish APIs
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: 40 CHAPTER 4. COUNTING1 unsigned lo
Page 54 and 55: 42 CHAPTER 4. COUNTING1 #define THE
Page 56 and 57: 44 CHAPTER 4. COUNTING1 unsigned lo
Page 58 and 59: 46 CHAPTER 4. COUNTINGReadsAlgorith
Page 60 and 61: 48 CHAPTER 5. PARTITIONING AND SYNC
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 100 and 101: 88 CHAPTER 8. DEFERRED PROCESSINGvo
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 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 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 176 and 177:
Page 178 and 179:
Page 180 and 181:
Page 182 and 183:
Page 184 and 185:
Page 186 and 187:
Page 188 and 189:
Page 190 and 191:
Page 192 and 193:
Page 194 and 195:
Page 196 and 197:
184 APPENDIX D. READ-COPY UPDATE IM
Page 198 and 199:
Page 200 and 201:
Page 202 and 203:
Page 204 and 205:
Page 206 and 207:
Page 208 and 209:
Page 210 and 211:
Page 212 and 213:
Page 214 and 215:
Page 216 and 217:
Page 218 and 219:
Page 220 and 221:
Page 222 and 223:
Page 224 and 225:
Page 226 and 227:
Page 228 and 229:
Page 230 and 231:
Page 232 and 233:
Page 234 and 235:
Page 236 and 237:
Page 238 and 239:
Page 240 and 241:
Page 242 and 243:
Page 244 and 245:
Page 246 and 247:
Page 248 and 249:
Page 250 and 251:
Page 252 and 253:
Page 254 and 255:
Page 256 and 257:
244 APPENDIX E. FORMAL VERIFICATION
Page 258 and 259:
Page 260 and 261:
Page 262 and 263:
Page 264 and 265:
Page 266 and 267:
Page 268 and 269:
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?