01. Introduction
0101 Overview Of Concurrency, Parallelism, And Non-Blocking I-O
0102 About The Author
0103 Technical Definitions Of Concurrency And Parallelism
0104 Why Examples In Various Programming Languages?
0105 The Big Picture - Apps, System Libraries, And Kernel Routines
0106 Getting Started
0107 How To Access Your Working Files

02. Concurrency And Parallelism
0201 Processes And Threads
0202 Multiprocessing
0203 Multithreading
0204 Non-Blocking I-O
0205 Chapter Review
0206 Hybrid Approaches - The Rule, Not The Exception

03. Multiprocessing Basics
0301 Overview Of The First Multiprocessing Example - Unnamed Pipes In C
0302 Source Code For The First Multiprocessing Example
0303 Overview Of The Second Multiprocessing Example - Named Pipes In C
0304 Source Code For The Second Multiprocessing Example
0305 Multiprocessing The Nginx Web Server
0306 Overview Of Execing And Forking Options In Multiprocessing
0307 Source Code For The Execing Multiprocessing Example
0308 Process Tracking And Management

04. Multiprocessing Through Richer Code Examples
0401 Multiprocessing In Node JS
0402 Interprocess Communication Mechanisms - IPC
0403 Overview Of The Shared-Memory IPC Example
0404 Source Code For The Shared-Memory IPC Example
0405 The Nginx Web Server And Unicorn App Server Architecture
0406 Overview Of The Three Sample Web Servers
0407 The Multiprocessing Web Server
0408 Exercise - Which Process Prints What And Why?
0409 Upsides And Downsides Of Multiprocessing

05. Multithreading Basics
0501 Overview Of Multithreading
0502 A Sample Race Condition In Java
0503 Analysis Of The Race Condition Code
0504 Overview Of Explicit Thread Locking
0505 A Sample Deadlock In Java
0506 High-Level Concurrency Management In Multithreading
0507 Wrap Up Of Multithreading Basics
0508 Exercise - Timing The Cost Of Explicit Locking

06. Multithreading Through Richer Code Examples
0601 The Miser-Spendthrift Problem In C
0602 Fixing The Miser-Spendthrift Problem In C
0603 Overview Of The Miser-Spendthrift Problem In Java
0604 Miser-Spendthrift Examples In Java
0605 Thread Synchronization As Cooperation
0606 The Thread-Safe Stack Example In Java
0607 The Multithreading Web Server
0608 Chapter Review
0609 Exercise - Thread Pools And Thread Cooperation

07. Thread-Safety And High-Level Concurrent Types In Java
0701 Thread Safety Through High-Level Thread-Safe Data Types
0702 Overview Of The BlockingQueue Example In Java
0703 The BlockingQueue Example - The Java Code
0704 Overview Of The Semaphores Example
0705 The Semaphore-Executor Code Example In Java
0706 Overview Of The Fork-Join Framework In Java
0707 The Filesearcher Example In Java
0708 Futures And Callables In Java - A Code Example
0709 Thread Safety Through Immutable Types And Pure Functions
0710 Chapter Review
0711 Exercise - A Producer-Consumer Program With Thread-Safe Channels

08. Options For Thread Synchronization And Cooperation
0801 Locking Memory Versus Thread-Safe Channels And Memory Owners
0802 Overview Of Goroutines And Channels
0803 Explicit Locking In Go - The Miser-Spendthrift Problem Redux
0804 Thread-Pooling And Thread-Safe Channels In Go - The Miser-Spendthrift Problem Yet Again
0805 Chapter Review

09. Concurrency And Non-Blocking I-O
0901 What Exactly Is Non-Blocking I-O?
0902 Non-Blocking I-O As A Concurrency Mechanism
0903 Overview Of The Epoller Example In C
0904 The Epoller Code Modules In C
0905 Overview Of The Non-Blocking I-O Example In Java
0906 The Non-Blocking Server Code - Java
0907 The Non-Blocking Client Code - Java
0908 Overview Of The Polling Server Web Server
0909 The Code For The Polling Server
0910 Exercise - Polling Multiple Data Sources Using Non-Blocking I-O

10. Parallelism Basics
1001 Overview Of Parallelism Beyond Concurrency
1002 Flynn Taxonomy As A Starting Point
1003 A SIMD Auto Vectorization Code Example In C
1004 The Parallel Instructions Of The SIMD Example In The Assembly Code
1005 Timing The Performance Boost From Parallelism - A Code Example
1006 Overview Of The OpenMP Framework For Auto Vectorization
1007 OpenMP Basics In A Code Example
1008 The Miser-Spendthrift Problem In OpenMP
1009 SIMD Programming In OpenMP
1010 Wrap Up On Data Parallelism - SIMD Basics

11. Parallelism And Performance
1101 How Can Performance Gains Through Parallelism Be Measured?
1102 The ParallelSort Program In Java
1103 Amdahls Law By Example
1104 Exercise - Use Timings To Get Data On Performance Trends

12. Parallelism And Distributed Computing
1201 Distributed Systems And Parallelism Overview
1202 Map-Reduce Overview
1203 Java 8 Support For Map-Reduce Operations
1204 Map-Reduce Code Example - The Book Index Program In Java
1205 OpenMPI Overview
1206 OpenMPI Example - MPI Basics
1207 OpenMPI Example - MPI Message Passing
1208 Wrap Up Of Distributed Systems And Parallelism
1209 Exercise - Code An OpenMPI Solution To The Book Index Map-Reduce Problem

13. Conclusion
1301 Course Wrap Up