CHAPTER 0: Introduction

• 0.0 Computing
• 0.1 Computing Hardware
• 0.2 Parallel Computing
• 0.3 Parallel Performance
  • 0.3.1 Measuring Performance: Timing
  • 0.3.2: Calculating Speedup and Computational Efficiency
  • 0.3.3: Scalability
  • 0.3.4: Amdahl’s Law
  • 0.3.5: The Gustafson-Barsis Law
• 0.4 Parallel Programming Strategies
  • 0.4.0: Parallel Loop Strategies
  • 0.4.3: The Leader-Worker Strategy
  • 0.4.2: The Shared Queue (with Leader-Worker + Barrier) Strategy
  • 0.4.3: The Reduction Strategy
  • 0.4.4: The Single Program, Multiple Data (SPMD) Strategy
  • 0.4.5: Data Decomposition vs. Task Decomposition
• 0.5 Parallel Computing Hardware Platforms
  • 0.5.0: Shared-Memory Multiprocessors
  • 0.5.1: Distributed-Memory Multiprocessors

You have attempted of activities on this page