CoE 163 S2 AY 2020-2021

Course Information

Academic Period: 2nd Semester AY 2020-2021
Units: 3
Workload:

• 3 hours lecture per week
• 1-2 hours exercise per week

Instructors:

• Carl C. Dizon [carl.dizon at eeemail]
• Isabel A. Montes [isabel.austria at eeemail]
• Nestor Michael C. Tiglao [nestor at eeemail]

Synopsis: This course aims to 1) present the connection between algorithms, implementation, and computer architecture, 2) provide tools needed to write and apply fast numerical code, and 3) present representative fundamental numerical algorithms.
Delivery Method: Video lectures and digital materials
Online Platforms: UVLe, Piazza, Google Meet, Zoom, other quiz platforms.

Course Outline

Week	Topics	Expected Academic Requirements	Resource Links
0	[00] Course overview and synopsis [00] Course requirements		[00 slides (WFQ)]
1	[01a] Review of CS data structures and algorithms [01b] Problem identification and solving	Short quiz Machine exercise	[01a slides] [01b slides]
2	Review of asymptotic analysis Amortized analysis Comparison of programming languages Matching problems with programming language	Short quiz
3	High-level code translation to memory Introduction to parallel programming	Machine exercise
4	Cache behavior of linear algebra algorithms Review of linear algebra operations Solving problems using linear algebra	Short quiz
5	Memory optimization of matrix-matrix multiplication Automatically-tuned linear algebra software	Short quiz
6	Gaussian elimination Matrix inversion	Machine exercise
7	Sparse linear algebra Matrix decomposition	Machine exercise
8	Parallel computing concepts Limits of parallel computing	Short quiz
9	Single instruction multiple data vectorization OpenCL/OpenMP	Machine exercise
10	GPU programming introduction	Machine exercise
11	Parallel computing algorithms	Short quiz
12		Capstone exercise

Grading Rubric

25% Short quizzes
50% Machine exercises
25% Capstone exercise