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$

218 APPENDIX D. READ-COPY UPDATE IMPLEMENTATIONS1 static void2 rcu_process_gp_end(struct rcu_state *rsp,3 struct rcu_data *rdp)4 {5 long completed_snap;6 unsigned long flags;78 local_irq_save(flags);9 completed_snap = ACCESS_ONCE(rsp->completed);10 if (rdp->completed != completed_snap) {11 rdp->nxttail[RCU_DONE_TAIL] =12 rdp->nxttail[RCU_WAIT_TAIL];13 rdp->nxttail[RCU_WAIT_TAIL] =14 rdp->nxttail[RCU_NEXT_READY_TAIL];15 rdp->nxttail[RCU_NEXT_READY_TAIL] =16 rdp->nxttail[RCU_NEXT_TAIL];17 rdp->completed = completed_snap;18 }19 local_irq_restore(flags);20 }Figure D.35: Noting End of Old Grace Periods−>next−>func−>nxtlist−>nxttail[RCU_DONE_TAIL]−>nxttail[RCU_WAIT_TAIL]−>nxttail[RCU_NEXT_READY_TAIL]−>nxttail[RCU_NEXT_TAIL]−>next−>func−>next−>func−>next−>func−>next−>func−>next−>func1 static void2 rcu_start_gp(struct rcu_state *rsp, unsigned long flags)3 __releases(rcu_get_root(rsp)->lock)4 {5 struct rcu_data *rdp = rsp->rda[smp_processor_id()];6 struct rcu_node *rnp = rcu_get_root(rsp);7 struct rcu_node *rnp_cur;8 struct rcu_node *rnp_end;910 if (!cpu_needs_another_gp(rsp, rdp)) {11 spin_unlock_irqrestore(&rnp->lock, flags);12 return;13 }14 rsp->gpnum++;15 rsp->signaled = RCU_GP_INIT;16 rsp->jiffies_force_qs = jiffies +17 RCU_JIFFIES_TILL_FORCE_QS;18 rdp->n_rcu_pending_force_qs = rdp->n_rcu_pending +19 RCU_JIFFIES_TILL_FORCE_QS;20 record_gp_stall_check_time(rsp);21 dyntick_record_completed(rsp, rsp->completed - 1);22 note_new_gpnum(rsp, rdp);23 rdp->nxttail[RCU_NEXT_READY_TAIL] =24 rdp->nxttail[RCU_NEXT_TAIL];25 rdp->nxttail[RCU_WAIT_TAIL] =26 rdp->nxttail[RCU_NEXT_TAIL];27 if (NUM_RCU_NODES == 1) {28 rnp->qsmask = rnp->qsmaskinit;29 spin_unlock_irqrestore(&rnp->lock, flags);30 return;31 }32 spin_unlock(&rnp->lock);33 spin_lock(&rsp->onofflock);34 rnp_end = rsp->level[NUM_RCU_LVLS - 1];35 rnp_cur = &rsp->node[0];36 for (; rnp_cur < rnp_end; rnp_cur++)37 rnp_cur->qsmask = rnp_cur->qsmaskinit;38 rnp_end = &rsp->node[NUM_RCU_NODES];39 rnp_cur = rsp->level[NUM_RCU_LVLS - 1];40 for (; rnp_cur < rnp_end; rnp_cur++) {41 spin_lock(&rnp_cur->lock);42 rnp_cur->qsmask = rnp_cur->qsmaskinit;43 spin_unlock(&rnp_cur->lock);44 }45 rsp->signaled = RCU_SIGNAL_INIT;46 spin_unlock_irqrestore(&rsp->onofflock, flags);47 }Figure D.37: Starting a Grace PeriodFigure D.36: RCU Callback Listmanaged as a singly linked list with multiple tailpointers, as shown in Figure D.36. This multiple tailpointer layout, spearheaded by Lai Jiangshan, simplifieslist handling [Jia08]. In this figure, the bluebox represents one CPU’s rcu_data structure, withthe six white boxes at the bottom of the diagramrepresenting a list of six RCU callbacks (rcu_headstructures). In this list, the first three callbacks havepassed through their grace period and are thus waitingto be invoked, the fourth callback (the first onthe second line) is waiting for the current grace periodto complete, and the last two are waiting for thenext grace period. The last two tail pointers referencethe last element, so that the final sublist, whichwould comprise callbacks that had not yet been associatedwith a specific grace period, is empty.Lines 8 and 19 of Figure D.35 suppress and reenableinterrupts, respectively. Line 9 picks up asnapshot of the rcu_state structure’s ->completedfield, storing it in the local variable completed_snap. Line 10 checks to see if the current CPU isnot yet aware of the end of a grace period, and if itis not aware, lines 11-16 advance this CPU’s RCUcallbacks by manipulating the tail pointers. Line 17then records the most recently completed grace periodnumber in this CPU’s rcu_data structure inthe ->completed field.D.3.6.3 Starting a Grace PeriodFigure D.37 shows rcu_start_gp(), which starts anew grace period, also releasing the root rcu_nodestructure’s lock, which must be acquired by thecaller.Line4isannotationforthesparseutility, indicat-
D.3. HIERARCHICAL RCU CODE WALKTHROUGH 219ingthatrcu_start_gp()releasestherootrcu_nodestructure’s lock. Local variable rdp references therunning CPU’s rcu_data structure, rnp referencesthe root rcu_node structure, and rnp_cur and rnp_end are used as cursors in traversing the rcu_nodehierarchy.Line 10 invokes cpu_needs_another_gp() to seeif this CPU really needs another grace period to bestarted,andifnot,line11releasestherootrcu_nodestructure’s lock and line 12 returns. This code pathcan be executed due to multiple CPUs concurrentlyattempting to start a grace period. In this case, thewinner will start the grace period, and the losers willexit out via this code path.Otherwise, line 14 increments the specified rcu_state structure’s ->gpnum field, officially markingthe start of a new grace period.Quick Quiz D.43: But there has been no initializationyet at line 15 of Figure D.37! <strong>What</strong> happensif a CPU notices the new grace period and immediatelyattempts to report a quiescent state? Won’t itget confused?Line 15 sets the->signaled field toRCU_GP_INITin order to prevent any other CPU from attemptingto force an end to the new grace period before its initializationcompletes. Lines 16-18 schedule the nextattempt to force an end to the new grace period,first in terms of jiffies and second in terms of thenumber of calls to rcu_pending. Of course, if thegrace period ends naturally before that time, therewill be no need to attempt to force it. Line 20 invokesrecord_gp_stall_check_time() to schedulea longer-term progress check—if the grace period extendsbeyond this time, it should be considered tobe an error. Line 22 invokes note_new_gpnum() inorder to initialize this CPU’s rcu_data structure toaccount for the new grace period.Lines 23-26 advance all of this CPU’s callbacksso that they will be eligible to be invoked at theend of this new grace period. This represents anacceleration of callbacks, as other CPUs would onlybe able to move the RCU_NEXT_READY_TAIL batch tobe serviced by the current grace period; the RCU_NEXT_TAIL would instead need to be advanced tothe RCU_NEXT_READY_TAIL batch. The reason thatthis CPU can accelerate the RCU_NEXT_TAIL batchis that it knows exactly when this new grace periodstarted. In contrast, other CPUs would be unable tocorrectly resolve the race between the start of a newgrace period and the arrival of a new RCU callback.Line 27 checks to see if there is but one rcu_nodestructure in the hierarchy, and if so, line 28 sets the->qsmask bits corresponding to all online CPUs, inotherwords, correspondingtothoseCPUsthatmustpass through a quiescent state for the new grace periodto end. Line 29 releases the root rcu_nodestructure’s lock and line 30 returns. In this case,gcc’s dead-code elimination is expected to dispensewith lines 32-46.Otherwise, the rcu_node hierarchy has multiplestructures, requiring a more involved initializationscheme. Line 32 releases the root rcu_node structure’s lock, but keeps interrupts disabled,and then line 33 acquires the specified rcu_statestructure’s->onofflock, preventing any concurrentCPU-hotplug operations from manipulating RCUspecificstate.Line34setsthernp_endlocalvariabletoreferencethefirstleafrcu_nodestructure, whichalsohappensto be the rcu_node structure immediately followingthe last non-leaf rcu_node structure in the ->nodearray. Line 35 sets the rnp_cur local variable toreference the root rcu_node structure, which alsohappens to be first such structure in the ->node array.Lines 36 and 37 then traverse all of the non-leafrcu_node structures, setting the bits correspondingto lower-level rcu_node structures that have CPUsthat must pass through quiescent states in order forthe new grace period to end.Quick Quiz D.44: Hey!!! Shouldn’t we hold thenon-leaf rcu_node structures’ locks when mungingtheir state in line 37 of Figure D.37???Line 38 sets local variablernp_end to one past thelast leaf rcu_node structure, and line 39 sets localvariable rnp_cur to the first leaf rcu_node structure,so that the loop spanning lines 40-44 traversesall leaves of the rcu_node hierarchy. During eachpass through this loop, line 41 acquires the currentleaf rcu_node structure’s lock, line 42 sets the bitscorresponding to online CPUs (each of which mustpass through a quiescent state before the new graceperiod can end), and line 43 releases the lock.Quick Quiz D.45: Why can’t we merge the loopspanning lines 36-37 with the loop spanning lines 40-44 in Figure D.37?Line 45 then sets the specified rcu_state structure’s->signaled field to permit forcing of quiescentstates, and line 46 releases the ->onofflock topermit CPU-hotplug operations to manipulate RCUstate.D.3.6.4 Reporting Quiescent StatesThishierarchicalRCUimplementationimplementsalayered approach to reporting quiescent states, usingthe following functions:1. rcu_qsctr_inc() and rcu_bh_qsctr_inc()are invoked when a given CPU passes through a
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 176 and 177:
Page 178 and 179:
Page 180 and 181: 168 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 280 and 281:
268 APPENDIX E. FORMAL VERIFICATION
Page 282 and 283:
270 APPENDIX E. FORMAL VERIFICATION
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?

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?