内容简介
本书主要讨论共享存储通信方式下的多处理器并发程序设计。首先介绍基本原理，分析异步并发环境中的可计算问题括相关度量标准和方法。然后开展应用实践，侧重于并发程序的能分析。每一章讨论一种特定的并发数据结构、程序设计模式或算法技巧。第2版对数据并行、事务编程、存储管理等内容做了更新和扩充，并采用C++语言重构相关示例，更加关注底层机制。
目录
CHAPTER 1 Introduction 1.1 Shared objects and synchronization 1.2 A fable 1.2.1 Properties of a mutual exclusion protocol 1.2.2 The moral 1.3 The producer–consumer problem 1.4 The readers-writers problem 1.5 The harsh realities of parallelization 1.6 Parallel programming 1.7 Chapter noter/> 1.8 Exerciser/>PART 1 Principler/> CHAPTER 2 Mutual exclusion 2.1 Time and eventr/> 2.2 Critical sectionr/> 2.3 Two-thread solutionr/> 2.3.1 The LockOne clar/> 2.3.2 The LockTwo clar/> 2.3.3 The Peterson lock 2.4 Notes on deadlock 2.5 The filter lock 2.6 Fairner/> 2.7 Lamport's Bakery algorithm 2.8 Bounded timestampr/> 2.9 Lower bounds on the number of locationr/> 2.10 Chapter noter/> 2.11 Exerciser/> CHAPTER 3 Concurrent objectr/> 3.1 Concurrency and correctner/> 3.2 Sequential objectr/> 3.3 Sequential consistency 3.3.1 Sequential consistency versus real-time order 3.3.2 Sequential consistency is nonblo 3.3.3 Compositionality 3.4 Linearizability 3.4.1 Linearization pointr/> 3.4.2 Linearizability versus sequential consistency 3.5 Quiescent consistency 3.5.1 Properties of quiescent consistency 3.6 Formal definitionr/> 3.6.1 Historier/> 3.6.2 Linearizability 3.6.3 Linearizability is compositional 3.6.4 Linearizability is nonblo 3.7 Memory consistency modelr/> 3.8 Progress conditionr/> 3.8.1 Wait-freedom 3.8.2 Lock-freedom 3.8.3 Obstruction-freedom 3.8.4 Blo progress conditionr/> 3.8.5 Characterizing progress conditionr/> 3.9 Remarkr/> 3.10 Chapter noter/> 3.11 Exerciser/> CHAPTER 4 Foundations of shared memory 4.1 The space of registerr/> 4.2 Register constructionr/> 4.2.1 Safe MRSW registerr/> 4.2.2 A regular Boolean MRSW register 4.2.3 A regular M-valued MRSW register 4.2.4 An atomic SRSW register 4.2.5 An atomic MRSW register 4.2.6 An atomic MRMW register 4.3 Atomic snapshotr/> 4.3.1 An obstruction-free snapshot 4.3.2 A wait-free snapshot 4.3.3 Correctness argumentr/> 4.4 Chapter noter/> 4.5 Exerciser/> CHAPTER 5 The relative power of primitive synchronization operationr/> 5.1 Consensus numberr/> 5.1.1 States and valence 5.2 Atomic registerr/> 5.3 Consensus protocolr/> 5.4 FIFO queuer/> ……PART 2 PracticeAPPENDIX A Software basicr/>APPENDIX B Hardware basicr/>