Tabla de Contenidos: “…3.5.3 The barbershop problem: introducing fairness -- 3.5.4 Readers-writers -- 3.5.4.1 A solution favoring the readers -- 3.5.4.2 Giving priority to the writers -- 3.5.4.3 A fair solution -- 3.6 Monitors -- 3.6.1 Design approach 1: critical section inside the monitor -- 3.6.2 Design approach 2: monitor controls entry to critical section -- 3.7 Applying monitors in classical problems -- 3.7.1 Producers-consumers revisited -- 3.7.1.1 Producers-consumers: buffer manipulation within the monitor -- 3.7.1.2 Producers-consumers: buffer insertion/extraction exterior to the monitor -- 3.7.2 Readers-writers -- 3.7.2.1 A solution favoring the readers -- 3.7.2.2 Giving priority to the writers -- 3.7.2.3 A fair solution -- 3.8 Dynamic vs. static thread management -- 3.8.1 Qt's thread pool -- 3.8.2 Creating and managing a pool of threads -- 3.9 Debugging multithreaded applications -- 3.10 Higher-level constructs: multithreaded programming without threads -- 3.10.1 Concurrent map -- 3.10.2 Map-reduce -- 3.10.3 Concurrent filter -- 3.10.4 Filter-reduce -- 3.10.5 A case study: multithreaded sorting -- 3.10.6 A case study: multithreaded image matching -- Exercises -- Chapter 4: Shared-memory programming: OpenMP -- 4.1 Introduction -- 4.2 Your First OpenMP Program -- 4.3 Variable Scope -- 4.3.1 OpenMP Integration V.0: Manual Partitioning -- 4.3.2 OpenMP Integration V.1: Manual Partitioning Without a Race Condition -- 4.3.3 OpenMP Integration V.2: Implicit Partitioning with Locking -- 4.3.4 OpenMP Integration V.3: Implicit Partitioning with Reduction -- 4.3.5 Final Words on Variable Scope -- 4.4 Loop-Level Parallelism -- 4.4.1 Data Dependencies -- 4.4.1.1 Flow Dependencies -- 4.4.1.2 Antidependencies -- 4.4.1.3 Output Dependencies -- 4.4.2 Nested Loops -- 4.4.3 Scheduling -- 4.5 Task Parallelism -- 4.5.1 The sections Directive -- 4.5.1.1 Producers-Consumers in OpenMP…”