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 11
Synthesis and Exam Preparation
1
Cache Performance and AMAT Calculations
Solve numerical problems involving cache performance metrics and average memory access time
2
Predicting Parallel Speedup: Amdahl's and Gustafson's Laws
Solve numerical problems applying Amdahl's Law and Gustafson's Law to predict parallel speedup
3
C++ Code Analysis: Dependencies, Race Conditions, and Bottlenecks
Analyze C++ code fragments to identify data dependencies, race conditions, and performance bottlenecks
4
OpenMP Execution and Variable Prediction
Trace the execution of OpenMP code to predict final variable values and identify parallel regions
5
Tracing MPI Communication Patterns
Trace the execution of MPI code involving point-to-point and collective communication
6
CUDA Kernel Execution: Memory Tracking
Trace the execution of simple CUDA kernels, tracking values in global and shared memory
7
Choosing the Right Parallel Model
Select and justify the most appropriate parallel model (OpenMP, MPI, CUDA, MapReduce) for various problem scenarios
8
Comparing Parallel System Architectures
Compare the architectural trade-offs of shared-memory, distributed-memory, and data-parallel systems
End of course,
Back to course
Previous module
Data-Parallel Processing with MapReduce
Next module