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

You are viewing an old semester: AY2014/2015 Semester 1
Class times, venues and exams may have changed since. View current offering
ModsCE4011AY2014/2015 Semester 1

Parallel Computing

AY2014/2015 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. 1. Introduction and Motivation. Motivation for Parallelism: parallel computing, speed up, Moore's law, grand challenge problems, trends. 2. Parallel Computing Systems. Flynn's taxonomy, shared memory architectures, distributed memory architectures, clusters, networks of workstations, heterogeneous architectures. 3. Performance Analysis. Performance Measures: speed up, efficiency, cost. Amdahl's law, Gustafson's law. Parallel Computational Models: PRAM, BSP, Cluster cost model. 4. Shared Memory Parallelism. Threads. OpenMP Compiler Directives. Partitioning Techniques. Examples: Mandelbrot set, Monte Carlo methods, N-body problem, Barnes Hut algorithm. 5. 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. 6. Synchronous Computations. Data Parallel Programming, Global and Local Synchronization. Examples: solving linear equations, cellular automata. 7. Scheduling and Load Balancing. Scheduling. Static Load Balancing. Dynamic Load Balancing. Example: Moore's Algorithm. Performance Tools. 8. 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.

AUs3.0 AUs
Categories
CoreBDE
Mutually Exclusive WithCPE423
Exam

Available indexes

These class times are for AY2014/2015 Semester 1 only. See the current timings
MonTueWedThuFri
830

10718 LAB (FCS1)

0830-1030 Mon

SWLAB1A

Wk4,6,8,10,12

900
930
1000
1030

COMMON LEC (CE4)

1030-1130 Mon

LT8

COMMON LEC (CE4)

1030-1130 Thu

LT13

1100
1130

10718 TUT (CE4)

1130-1230 Mon

LT8

10719 TUT (CE4)

1130-1230 Mon

LT8

1200
1230
1300
1330
1400
1430

10719 LAB (FCS2)

1430-1630 Wed

SWLAB1A

Wk4,6,8,10,12

1500
1530
1600

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.