多处理器编程的艺术（英文版·原书第2版）
正版图书，可开发票，请放心购买。
￥ 160.56 8.1折 ￥ 199 全新
库存3件
广东广州
认证卖家担保交易快速发货售后保障
作者[美]莫里斯·赫利希(Maurice Herlihy),[美]尼尔·沙维特(Nir Shavit),[美]维克多·卢昌科(Victor Luchangco),[美]迈克尔·斯皮尔(Michael S
出版社机械工业
ISBN9787111695691
出版时间2021-11
装帧平装
开本其他
定价199元
货号31313339
上书时间2023-09-11
- 店主推荐
- 最新上架
商品详情
- 品相描述：全新
- 商品描述
-
作者简介
莫里斯·赫利希（MauriceHerlihy）布朗大学计算机科学教授，曾任职于卡内基·梅隆大学和DEC公司剑桥实验室。他获得了包括EdsgerW.Dijkstra奖（2003，2012）、ACM/EATCSGödel奖（2004）、IEEEWallaceMcDowell奖（2013）和Fulbright杰出讲席（2012）在内的众多荣誉。他是ACM会士，美国国家发明家科学院、美国国家工程院以及美国艺术与科学院院士。他拥有麻省理工学院计算机科学博士学位。<br><br>尼尔·沙维特（NirShavit）麻省理工学院计算机科学教授，特拉维夫大学计算机科学教授，曾任职于Sun实验室和Oracle实验室。他与MauriceHerlihy分享了EdsgerW.Dijkstra奖（2012）和ACM/EATCSGödel奖（2004）。他拥有希伯来大学计算机科学博士学位。<br><br>维克多·卢昌科（VictorLuchangco）Algorand公司高级算法研究员，曾任职于Sun实验室和Oracle实验室。他拥有麻省理工学院计算机科学博士学位。<br><br>迈克尔·斯皮尔（MichaelSpear）理海大学计算机科学教授。他拥有罗切斯特大学计算机科学博士学位。
目录
Preface<br/>Acknowledgments<br/>Suggestedwaystoteachtheartofmultiprocessorprogramming<br/>CHAPTER 1 Introduction .................................... 1 <br/>1.1 Sharedobjectsandsynchronization .................... 3 <br/>1.2 Afable ......................................... 6 <br/>1.2.1 Propertiesofamutualexclusionprotocol .......... 8 <br/>1.2.2 Themoral .................................. 9 <br/>1.3 Theproducer–consumerproblem...................... 9 <br/>1.4 Thereaders–writersproblem ......................... 11 <br/>1.5 Theharshrealitiesofparallelization.................... 12 <br/>1.6 Parallelprogramming .............................. 14 <br/>1.7 Chapternotes..................................... 15 <br/>1.8 Exercises........................................ 15 <br/>PART 1 Principles <br/>CHAPTER2 Mutual exclusion ............................... 21 <br/>2.1 Timeandevents................................... 21 <br/>2.2 Criticalsections................................... 22 <br/>2.3 Two-threadsolutions ............................... 25 <br/>2.3.1 TheLockOne class ............................ 25 <br/>2.3.2 TheLockTwo class ............................ 26 <br/>2.3.3 ThePetersonlock ............................ 27 <br/>2.4 Notesondeadlock ................................. 29 <br/>2.5 Thefilterlock .................................... 30 <br/>2.6 Fairness......................................... 33 <br/>2.7 Lamport’sBakeryalgorithm ......................... 34 <br/>2.8 Boundedtimestamps ............................... 35 <br/>2.9 Lowerboundsonthenumberoflocations ............... 39 <br/>2.10Chapternotes..................................... 41 <br/>2.11 Exercises........................................ 42 <br/>CHAPTER 3 Concurrent objects ............................. 49 <br/>3.1 Concurrencyandcorrectness ......................... 49 <br/>3.2 Sequentialobjects ................................. 52 <br/>3.3 Sequentialconsistency.............................. 53 <br/>3.3.1 Sequentialconsistencyversusreal-timeorder ....... 55 <br/>3.3.2 Sequentialconsistencyisnonblocking............. 56 <br/>3.3.3 Compositionality............................. 57 <br/>3.4 Linearizability .................................... 58 <br/>3.4.1 Linearizationpoints .......................... 58 <br/>3.4.2 Linearizabilityversussequentialconsistency ........ 59 <br/>3.5 Quiescentconsistency .............................. 59 <br/>3.5.1 Propertiesofquiescentconsistency ............... 60 <br/>3.6 Formaldefinitions ................................. 60 <br/>3.6.1 Histories ................................... 60 <br/>3.6.2 Linearizability............................... 61 <br/>3.6.3 Linearizabilityiscompositional.................. 63 <br/>3.6.4 Linearizabilityisnonblocking ................... 63 <br/>3.7 Memoryconsistencymodels ......................... 64 <br/>3.8 Progressconditions ................................ 64 <br/>3.8.1 Wait-freedom ............................... 65 <br/>3.8.2 Lock-freedom ............................... 65 <br/>3.8.3 Obstruction-freedom .......................... 66 <br/>3.8.4 Blockingprogressconditions ................... 67 <br/>3.8.5 Characterizingprogressconditions ............... 67 <br/>3.9 Remarks ........................................ 68 <br/>3.10 Chapternotes..................................... 69 <br/>3.11 Exercises........................................ 70 <br/>CHAPTER 4 Foundations of shared memory ................. 75 <br/>4.1 Thespaceofregisters .............................. 76 <br/>4.2 Registerconstructions .............................. 81 <br/>4.2.1 SafeMRSWregisters ......................... 82 <br/>4.2.2 AregularBooleanMRSWregister ............... 83 <br/>4.2.3 AregularM-valuedMRSWregister .............. 84 <br/>4.2.4 AnatomicSRSWregister ...................... 85 <br/>4.2.5 AnatomicMRSWregister ..................... 87 <br/>4.2.6 AnatomicMRMWregister..................... 90 <br/>4.3 Atomicsnapshots ................................. 92 <br/>4.3.1 Anobstruction-freesnapshot.................... 92 <br/>4.3.2 Await-freesnapshot .......................... 93 <br/>4.3.3 Correctnessarguments ........................ 97 <br/>4.4 Chapternotes..................................... 98 <br/>4.5 Exercises........................................ 99 <br/>CHAPTER 5 The relative power of primitive synchronization operations ..................... 103 <br/>5.1 Consensusnumbers ................................ 104 <br/>5.1.1 Statesandvalence............................ 105 <br/>5.2 Atomicregisters .................................. 106 <br/>5.3 Consensusprotocols ............................... 109 <br/>5.4 FIFOqueues ..................................... 110 <br/>5.5 Multipleassignmentobjects.......................... 113 <br/>5.6 Read–modify–writeoperations ....................... 116 <br/>5.7 Common2RMWoperations ......................... 117 <br/>5.8 ThecompareAndSet operation ......................... 119 <br/>5.9 Chapternotes..................................... 120 <br/>5.10 Exercises........................................ 121 <br/>CHAPTER 6 Universality of consensus ....................... 129 <br/>6.1 Introduction...................................... 129 <br/>6.2 Universality...................................... 130 <br/>6.3 Alock-freeuniversalconstruction ..................... 130 <br/>6.4 Await-freeuniversalconstruction ..................... 134 <br/>6.5 Chapternotes..................................... 140 <br/>6.6 Exercises........................................ 141 <br/>PART 2 Practice <br/>CHAPTER 7 Spin locks and contention ....................... 147 <br/>7.1 Welcometotherealworld ........................... 147 <br/>7.2 Volatilefieldsandatomicobjects ...................... 150 <br/>7.3 Test-and-setlocks ................................. 150 <br/>7.4 Exponentialback-off ............................... 154 <br/>7.5 Queuelocks...................................... 156 <br/>7.5.1 Array-basedlocks ............................ 156 <br/>7.5.2 TheCLHqueuelock.......................... 159 <br/>7.5.3 TheMCSqueuelock.......................... 161 <br/>7.6 Aqueuelockwithtimeouts .......................... 163 <br/>7.7 Hierarchicallocks ................................. 166 <br/>7.7.1 Ahierarchicalback-offlock .................... 167 <br/>7.7.2 Cohortlocks ................................ 167 <br/>7.7.3 Acohortlockimplementation ................... 170 <br/>7.8 Acompositelock.................................. 171 <br/>7.9 Afastpathforthreadsrunningalone ................... 178 <br/>7.10 Onelocktorulethemall ............................ 180 <br/>7.11 Chapternotes..................................... 180 <br/>7.12 Exercises........................................ 181 <br/>CHAPTER 8 Monitors and blocking synchronization .......... 183 <br/>8.1 Introduction...................................... 183 <br/>8.2 Monitorlocksandconditions......................... 183 <br/>8.2.1 Conditions ................................. 185 <br/>8.2.2 Thelost-wakeupproblem ...................... 187 <br/>8.3 Readers–writerslocks .............................. 189 <br/>8.3.1 Simplereaders–writerslock .................... 190 <br/>8.3.2 Fairreaders–writerslock ....................... 192 <br/>8.4Ourownreentrantlock.............................194<br/>8.5Semaphores......................................19<br/>8.6Chapternotes.....................................19<br/>8.7Exercises........................................197<br/>CHAPTER9 Linkedlists:Theroleoflocking.................201<br/>9.1 Introduction......................................201<br/>9.2 List-basedsets....................................20<br/>9.3 Concurrentreasoning...............................204<br/>9.4 Coarse-grainedsynchronization.......................20<br/>9.5 Fine-grainedsynchronization.........................207<br/>9.6 Optimisticsynchronization..........................211<br/>9.7 Lazysynchronization...............................215<br/>9.8 Nonbl
相关推荐
— 没有更多了 —
以下为对购买帮助不大的评价