New: hide modules, set class colours and see S1 and S2 exams together

Not offered in the current semester. Last offered AY2016/2017 Semester 1
ModsCZ4011

CZ4011 Parallel Computing

Last offered: AY2016/2017 Semester 1

This course provides students with an understanding of the concepts and techniques of parallel computing. This includes an understanding of the interaction between hardware and software, the power and limitations of parallelism and its benefits and challenges. Examples are used throughout the course to illustrate concepts and issues in parallel computing.

  • Introduction and Motivation. Motivation for Parallelism: parallel computing, speed up, Moore's law, grand challenge problems, trends.
  • Parallel Computing Systems. Flynn's taxonomy, shared memory architectures, distributed memory architectures, clusters, networks of workstations, heterogeneous architectures.
  • Performance Analysis. Performance Measures: speed up, efficiency, cost. Amdahl's law, Gustafson's law. Parallel Computational Models: PRAM, BSP, Cluster cost model.
  • Shared Memory Parallelism. Threads. OpenMP Compiler Directives. Partitioning Techniques. Examples: Mandelbrot set, Monte Carlo methods, N-body problem, Barnes Hut algorithm.
  • Distributed Memory Parallelism. Message Passing Libraries: processes, point-to-point and collective communication. MPI message passing routines. Data Partitioning. Examples: bucket sort, numerical integration. Divide-and-Conquer. Examples: merge sort, adaptive quadrature. Pipelining: Type 1, 2 and 3 pipelines. Examples: sum of sequence, insertion sort, prime number generation, back substitution.
  • Synchronous Computations. Data Parallel Programming, Global and Local Synchronization. Examples: solving linear equations, cellular automata.
  • Scheduling and Load Balancing. Scheduling. Static Load Balancing. Dynamic Load Balancing. Example: Moore's Algorithm. Performance Tools.
  • Applications. Sorting Algorithms. Examples: rank sort, compare and exchange, bubble sort, quicksort, bitonic mergesort. Numerical Algorithms. Examples: matrix algorithms, solving linear equations, Gaussian elimination; Jacobi iteration.
5hrs per week
AUs
3.0 AUs
Grade Type
None
Prerequisite
CZ2001, CZ3001
Exam
None

Prerequisite graph

CZ4011

Parallel Computing

Unlocks

No modules unlocked

Available indexes

MonTueWedThuFri
1030

COMMON LEC (CS4)

1030-1130 Mon

LT11

COMMON LEC (CS4)

1030-1130 Thu

LT11

1100
1130

10443 TUT (CS4)

1130-1230 Mon

LT11

1200
1230
1300
1330
1400
1430

10443 LAB (FCS1)

1430-1630 Wed

SWLAB1

Wk4,6,8,10,12

1500
1530
1600

Other offerings

YearSem 1Sem 2Special
AY15/16View--
AY14/15View--

Other relevant mods

Planning guides

View all articles

Found something wrong?

NTUMods is built and maintained by one person, so a short note goes a long way. Pick what fits, add the details, and I will look at it.

I'll use this to follow up with you.

Attaches your saved timetables and settings to help debug the issue. On by default, turn off to exclude it.

Developer? Open an issue or PR.