This course aims to equip students with fundamental knowledge and practical skills in parallel computing, with a strong emphasis on parallel algorithm design, parallel programming patterns, and performance-aware implementation. It is intended for students who are interested in understanding how computational problems can be decomposed, structured, and executed efficiently on parallel systems.
The course introduces the core principles of parallelism from the perspective of algorithm design through to implementation and execution. Students will learn how to analyze computational problems, identify opportunities for parallelism, and apply common parallel patterns to design scalable solutions. The course also covers the relationship between algorithms, programming models, and underlying hardware, enabling students to understand how design choices affect performance and scalability.
The curriculum is organized into several key components:
- Foundations of Parallel Computing: Introduction to the fundamental concepts of parallelism, including concurrency, decomposition strategies, task and data parallelism, and performance metrics.
- Parallel Architectures and Execution Models: Overview of modern parallel architectures and execution environments, including shared-memory and distributed-memory systems, and the impact of hardware characteristics on program performance.
- Parallel Algorithm Design and Patterns: Study of common parallel design strategies and patterns, such as divideand-conquer, pipeline, task parallelism, and data-parallel approaches, with emphasis on designing scalable algorithms.
- Parallel Programming and Performance Considerations: Implementation of parallel algorithms using established programming models, with attention to synchronization, communication, load balancing, and performance analysis.
Through this approach, students will gain experience in translating algorithmic ideas into efficient parallel implementations and understanding how programs execute on parallel systems. The course aims to develop students? ability to reason about parallel performance, design scalable solutions, and apply parallel computing techniques to computational problems in scientific and engineering domains.
Prerequisite graph
Available indexes
| Mon | Tue | Wed | Thu | Fri | ||
|---|---|---|---|---|---|---|
| 830 | 10534 LAB (TEL1) 0830-1120 Mon HWLAB1 Odd Weeks | 10544 LAB (TEL2) 0830-1120 Mon HWLAB1 Even Weeks | ||||
| 900 | ||||||
| 930 | ||||||
| 1000 | ||||||
| 1030 | ||||||
| 1100 | ||||||
| 1130 | ||||||
| 1200 | ||||||
| 1230 | ||||||
| 1300 | ||||||
| 1330 | ||||||
| 1400 | ||||||
| 1430 | COMMON LEC (SCL4) 1430-1620 Wed LT6 | |||||
| 1500 | ||||||
| 1530 | ||||||
| 1600 | ||||||
Other offerings
Other relevant mods
- SC1001Introduction to Computational Thinking & Programming
- SC1004Linear Algebra for Computing
- SC1005Digital Logic
- SC1006Computer Organisation & Architecture
- SC1007Data Structures & Algorithms
- SC1008C & C++ Programming
- SC1013Physics for Computing
- SC1123Math 1: Linear Algebra & Calculus for Computing
- SC1301Language & Logic
Planning guides
View all articlesBDE · 17 min read
Complete NTU BDE List: Every BDE Category and Module (AY2026/2027 Semester 2)
A complete NTU BDE list by category: languages, business, computing, humanities, arts, science, engineering, and more. Updated for AY2026/2027 Semester 2. Browse all 780+ BDE modules on NTUMods.
STARS · 9 min read
How to Bid for a BDE at NTU (STARS Registration Guide)
Step-by-step: how NTU STARS bidding works, what to do in Round 1 vs Round 2, and how to still get your BDE during add/drop if your first choice fills up.
STARS · 9 min read
NTU STARS Guide 2026: Registration Rounds, Bidding & Planner Tips
NTU STARS planner guide — how bidding rounds work, how to prepare a shortlist before registration opens, and what to do when a module fills up. Includes a free STARS planner tool.