Computer Science
Grade 11
20 min
5. Parallel Programming Models: Shared Memory vs. Distributed Memory
Explore different parallel programming models, including shared memory and distributed memory, and their trade-offs.
What you'll learn
- Identify the key characteristics that differentiate shared memory and distributed memory parallel programming models, listing at least three distinguishing features for each with 100% accuracy.
- Explain the advantages and disadvantages of both shared memory and distributed memory models in the context of at least two specific parallel programming tasks (e.g., image processing, matrix multiplication), justifying their reasoning in a written explanation with at least 80% accuracy based on resource utilization and communication overhead.
- Apply the appropriate parallel programming model (shared or distributed memory) to solve a given computational problem (e.g., sorting a large dataset) by outlining the steps needed to parallelize the solution with at least 75% accuracy and justifying the choice of model based on problem characteristics.
- Analyze the performance implications (e.g., speedup, scalability) of using shared memory versus distributed memory for a given parallel algorithm, identifying potential bottlenecks and suggesting optimization strategies with at least 70% accuracy.
Tutorial Preview
1
Introduction & Learning Objectives
Learning Objectives
Differentiate between the shared memory and distributed memory parallel programming models.
Identify the hardware architecture associated with each model (e.g., multi-core CPU vs. computer cluster).
Explain the role of synchronization in shared memory systems to prevent race conditions.
Describe the process of explicit communication (message passing) in distributed memory systems.
Analyze a given computational problem and recommend the more suitable programming model.
Compare the primary advantages and disadvantages of each model, including scalability and programming complexity.
How does a supercomputer with thousands of processors work together on one massive problem, like simulating a galaxy? 🌌 They have to talk, but how?
In this lesson, we'll e...
2
Key Concepts & Vocabulary
TermDefinitionExample
Shared Memory ModelA parallel programming model where multiple processors or cores share access to a single, global memory space. Communication between tasks is implicit, done by reading from and writing to this common memory.A multi-core CPU in your laptop. All cores can access the same RAM. A program can create multiple threads, and each thread can read or modify a shared variable, like a counter.
Distributed Memory ModelA parallel programming model where each processor has its own private memory. Processors cannot directly access another's memory and must communicate explicitly by sending and receiving messages over a network.A Beowulf cluster, which is a group of standard computers connected by a network. To calculate a large sum, one computer (the 'mas...
3
Core Syntax & Patterns
Shared Memory Pattern: The Lock
1. Identify shared resource.
2. Create a lock for that resource.
3. Before accessing the resource: `acquire_lock()`.
4. After accessing the resource: `release_lock()`.
Use this pattern whenever multiple threads need to read and modify the same variable or data structure. The lock ensures that the block of code between `acquire` and `release` is 'atomic'—it cannot be interrupted by other threads trying to access the same resource.
Distributed Memory Pattern: Send/Receive Pair
Process A: `send(data, destination=Process_B)`
Process B: `data = receive(source=Process_A)`
This is the fundamental communication pattern in distributed memory. For every `send` operation, there must be a corresponding `receive`. The processes must agree on the...
4 more steps in this tutorial
Sign up free to access the complete tutorial with worked examples and practice.
Sign Up Free to ContinueSample Practice Questions
Challenging
A multithreaded program requires access to two shared resources, Resource A and Resource B, each protected by its own lock, Lock A and Lock B. A deadlock occurs. Based on the tutorial's advice, what is the most effective strategy to prevent this?
A.Combine both resources into a single larger resource protected by one lock.
B.Use `send()` and `receive()` instead of locks.
C.Establish a global order, forcing all threads to acquire Lock A before acquiring Lock B.
D.Increase the number of threads so that one is more likely to acquire both locks successfully.
Challenging
You are designing a parallel application for a large cluster. A large, read-only configuration file (100 MB) must be available to all 1,000 processes. To minimize startup time and network congestion, what is the most efficient communication strategy?
A.The master process reads the file and sends it, one integer at a time, to all 999 other processes.
B.The master process reads the file once and performs a single 'broadcast' operation to send the entire file to all other processes simultaneously.
C.Each of the 1,000 processes independently reads the file from a shared network drive.
D.The master process sends the entire file to Process 1, which sends it to Process 2, and so on, in a chain.
Challenging
Why is debugging a race condition in a shared memory program often considered more difficult than debugging a message passing error (e.g., a mismatched send/receive) in a distributed memory program?
A.Race conditions are non-deterministic and may only appear under specific, hard-to-reproduce thread timings.
B.Message passing errors produce compiler warnings, whereas race conditions do not.
C.Distributed memory programs can be run on a single machine for debugging, but shared memory programs cannot.
D.The tools for debugging shared memory programs are less advanced than those for distributed memory.
Want to practice and check your answers?
Sign up to access all questions with instant feedback, explanations, and progress tracking.
Start Practicing FreeMore from I. Concurrent and Parallel Programming: Unleashing the Power of Multiple Cores
1. Introduction to Concurrency: Threads and Processes
2. Thread Management: Creation, Termination, and Synchronization
3. Synchronization Primitives: Mutexes, Semaphores, and Condition Variables
4. Deadlocks and Race Conditions: Identifying and Avoiding Problems
6. Introduction to OpenMP: Parallelizing Loops and Regions
Computer Science for other grades
Frequently asked questions
What grade level is "5. Parallel Programming Models: Shared Memory vs. Distributed Memory"?
5. Parallel Programming Models: Shared Memory vs. Distributed Memory is a Grade 11 Computer Science lesson on ExcelOS.
What will I learn in 5. Parallel Programming Models: Shared Memory vs. Distributed Memory?
You'll be able to: Identify the key characteristics that differentiate shared memory and distributed memory parallel programming models, listing at least three distinguishing features for each with 100% accuracy; Explain the advantages and….
Is "5. Parallel Programming Models: Shared Memory vs. Distributed Memory" free to practice?
Yes. You can read the tutorial preview for free, and signing up for a free ExcelOS account unlocks the full tutorial and all practice questions with instant feedback.
How many practice questions are included with 5. Parallel Programming Models: Shared Memory vs. Distributed Memory?
This lesson includes 25 practice questions across multiple difficulty levels, each with instant feedback and explanations.