Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
DS 221 AUG 3:1 Introduction to Scalable Systems (VSS/YS)
·
Module 5
Principles of Parallel Algorithm Analysis
1
Data Dependencies and Parallelization
Identify data dependencies (RAW, WAR, WAW) that constrain parallelization in code
2
Amdahl's Law for Parallel Speedup
Apply Amdahl's Law to calculate the theoretical speedup limit of a parallel algorithm
3
Analyzing Scaled Speedup with Gustafson's Law
Apply Gustafson's Law to analyze the scaled speedup of a parallel application
4
Parallel Efficiency and Scalability
Define and calculate parallel efficiency and distinguish between strong and weak scalability
5
Parallel Data Distribution Strategies
Describe common data distribution strategies for parallel processing: block, cyclic, and block-cyclic
6
Analyzing Parallel Algorithms with the PRAM Model
Analyze a simple parallel algorithm using the PRAM model (e.g., EREW, CREW)
7
Parallel Prefix Sum (Scan) Algorithm Design in the PRAM Model
Design a parallel prefix sum (scan) algorithm using the PRAM model
Previous module
Foundations of Parallel Architectures
Next module
Shared-Memory Parallelism with OpenMP