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$

336 BIBLIOGRAPHY[But97]USA, March 2009. Available: http://www.usenix.org/event/hotpar09/tech/full_papers/boehm/boehm.pdf[Viewed May 24, 2009].David Butenhof. Programming withPOSIX Threads. Addison-Wesley,Boston, MA, USA, 1997.[DSS06]Dave Dice, Ori Shalev, and NirShavit. Transactional locking II.In Proc. International Symposiumon Distributed Computing.Springer Verlag, 2006. Available:http://www.springerlink.com/content/5688h5q0w72r54x0/ [ViewedMarch 10, 2008].[Cor08]Jonathan Corbet. Linux weekly news.Available: http://lwn.net/ [ViewedNovember 26, 2008], November 2008.[CRKH05] Jonathan Corbet, Alessandro Rubini,and Greg Kroah-Hartman. Linux DeviceDrivers. O’ReillyMedia, Inc., thirdedition, 2005.[CSG99]David E. Culler, Jaswinder Pal Singh,and Anoop Gupta. Parallel ComputerArchitecture: a Hardware/Software Approach.Morgan Kaufman, 1999.[Des09] Mathieu Desnoyers. [RFC gittree] userspace RCU (urcu)for Linux. Available: http://lkml.org/lkml/2009/2/5/572http://lttng.org/urcu [ViewedFebruary 20, 2009], February 2009.[Dij71] Edsger W. Dijkstra. Hierarchicalordering of sequential processes. ActaInformatica, 1(2):115–138, 1971.Available: http://www.cs.utexas.edu/users/EWD/ewd03xx/EWD310.PDF[Viewed January 13, 2008].[DLMN09] Dave Dice, Yossi Lev, Mark Moir,and Dan Nussbaum. Early experiencewith a commericial hardwaretransactional memory implementation.In Fourteenth InternationalConference on Architectural Supportfor Programming Languages andOperating Systems (ASPLOS ’09),pages 157–168, Washington, DC,USA, March 2009. Available: http://research.sun.com/scalable/pubs/ASPLOS2009-RockHTM.pdf[Viewed February 4, 2009].[Dov90]Ken F. Dove. A high capacity TCP/IPin parallel STREAMS. In UKUUGConference Proceedings, London, June1990.[EGCD03] T. A. El-Ghazawi, W. W. Carlson, andJ. M. Draper. UPC language specificationsv1.1. Available: http://upc.gwu.edu [Viewed September 19, 2008],May 2003.[Eng68] Douglas Engelbart. The demo.Available: http://video.google.com/videoplay?docid=-8734787622017763097 [ViewedNovember 28, 2008], December 1968.[ENS05][ES05][Gar90]Ryan Eccles, Blair Nonneck, and DeborahA. Stacey. Exploring parallel programmingknowledge in the novice. InHPCS ’05: Proceedings of the 19th InternationalSymposium on High PerformanceComputing Systems and Applications,pages 97–102, Washington,DC, USA, 2005. IEEE Computer Society.Ryan Eccles and Deborah A. Stacey.Understanding the parallel programmer.In HPCS ’05: Proceedings of the19th International Symposium on HighPerformance Computing Systems andApplications, pages 156–160, Washington,DC, USA, 2005. IEEE ComputerSociety.Arun Garg. Parallel STREAMS: amulti-processor implementation. InUSENIX Conference Proceedings, pages163–176, Berkeley CA, February 1990.USENIX Association.[Gar07] Bryan Gardiner. Idf: Gordonmoore predicts end ofmoore’s law (again). Available:http://blog.wired.com/business/2007/09/idf-gordon-mo-1.html[Viewed: November 28, 2008], September2007.[GC96]MichaelGreenwaldandDavidR.Cheriton.The synergy between non-blockingsynchronization and operating system
BIBLIOGRAPHY 337[Gha95]structure. In Proceedings of the SecondSymposium on Operating SystemsDesign and Implementation, pages123–136, Seattle, WA, October 1996.USENIX Association.Kourosh Gharachorloo. Memory consistencymodels for shared-memorymultiprocessors. Technical ReportCSL-TR-95-685, Computer SystemsLaboratory, Departments of ElectricalEngineering and Computer Science,Stanford University, Stanford, CA,December 1995. Available: http://www.hpl.hp.com/techreports/Compaq-DEC/WRL-95-9.pdf [Viewed:October 11, 2004].[GHJV95] Erich Gamma, Richard Helm, RalphJohnson, and John Vlissides. DesignPatterns: Elements of Reusable Object-Oriented Software. Addison-Wesley,1995.[GKAS99] Ben Gamsa, Orran Krieger, JonathanAppavoo, and Michael Stumm.Tornado: Maximizing locality andconcurrency in a shared memorymultiprocessor operating system. InProceedings of the 3 rd Symposium onOperating System Design and Implementation,pages 87–100, New Orleans,LA, February 1999. Available: http://www.usenix.org/events/osdi99/full_papers/gamsa/gamsa.pdf[Viewed August 30, 2006].[GMTW08] D. Guniguntala, P. E. McKenney,J. Triplett, and J. Walpole. Theread-copy-update mechanism forsupporting real-time applications onshared-memory multiprocessor systemswith Linux. IBM Systems Journal,47(2):221–236, May 2008. Available:http://www.research.ibm.com/journal/sj/472/guniguntala.pdf[Viewed April 24, 2008].[GPB + 07] Brian Goetz, Tim Peierls, JoshuaBloch, Joseph Bowbeer, David Holmes,and Doug Lea. Java: Concurrency inPractice. Addison Wesley, Upper SaddleRiver, NJ, USA, 2007.[Gra02] Jim Gray. Super-servers: Commoditycomputer clusters posea software challenge. Available:http://research.microsoft.com/en-us/um/people/gray/papers/superservers(4t_computers).doc[Viewed: June 23, 2004], April 2002.[Gri00] Scott Griffen. Internet pioneers:Doug englebart. Available:http://www.ibiblio.org/pioneers/englebart.html [Viewed November28, 2008], May 2000.[Gro01]The Open Group. Single UNIX specification.http://www.opengroup.org/onlinepubs/007908799/index.html,July 2001.[Gro07] Dan Grossman. The transactionalmemory / garbage collection analogy.In OOPSLA ’07: Proceedingsof the 22nd annual ACM SIGPLANconference on Object oriented programmingsystems and applications,pages 695–706, New York, NY, USA,October 2007. ACM. Available: http://www.cs.washington.edu/homes/djg/papers/analogy_oopsla07.pdf[Viewed December 19, 2008].[HCS + 05] Lorin Hochstein, Jeff Carver, ForrestShull, Sima Asgari, and Victor Basili.Parallel programmer productivity: Acase study of novice parallel programmers.In SC ’05: Proceedings of the2005 ACM/IEEE conference on Supercomputing,page 35, Washington, DC,USA, 2005. IEEE Computer Society.[Her90][Her05][HM93]Maurice P. Herlihy. A methodology forimplementing highly concurrent datastructures. In Proceedings of the 2ndACM SIGPLAN Symposium on Principlesand Practice of Parallel Programming,pages 197–206, March 1990.Maurice Herlihy. The transactionalmanifesto: software engineering andnon-blocking synchronization. In PLDI’05: Proceedings of the 2005 ACMSIGPLAN conference on Programminglanguage design and implementation,pages 280–280, New York, NY, USA,2005. ACM Press.Maurice Herlihy and J. Eliot B. Moss.Transactional memory: Architecturalsupport for lock-free data structures.
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:
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: 286 APPENDIX F. ANSWERS TO QUICK QU
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 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?