Difference between revisions of "CoE 163 S2 AY 2020-2021"
Carl Dizon (talk | contribs) m |
Carl Dizon (talk | contribs) m |
||
Line 115: | Line 115: | ||
[https://colab.research.google.com/drive/1wOzAnnel_qm2z8_LUO1ijSSSw7yWdWMA <nowiki>[ME03] Jupyter notebook</nowiki>] | [https://colab.research.google.com/drive/1wOzAnnel_qm2z8_LUO1ijSSSw7yWdWMA <nowiki>[ME03] Jupyter notebook</nowiki>] | ||
|| | || | ||
+ | [[:File:Coe163 2020s2 06a blas atlas.pdf | [06a slides]]] | ||
|- | |- | ||
| 7 | | 7 | ||
Line 124: | Line 125: | ||
[https://uvle.upd.edu.ph/mod/quiz/view.php?id=478785 <nowiki>[SQ03] Submission bin</nowiki>]<br> | [https://uvle.upd.edu.ph/mod/quiz/view.php?id=478785 <nowiki>[SQ03] Submission bin</nowiki>]<br> | ||
|| | || | ||
+ | [[:File:Coe163 2020s2 07a gaussian elim.pdf | [07a slides]]]<br> | ||
+ | [[:File:Coe163 2020s2 07b sparse mat.pdf | [07b slides]]] | ||
|- | |- | ||
| 8 | | 8 | ||
Line 130: | Line 133: | ||
* Limits of parallel computing | * Limits of parallel computing | ||
|| | || | ||
− | |||
|| | || | ||
|- | |- | ||
Line 138: | Line 140: | ||
* OpenCL/OpenMP | * OpenCL/OpenMP | ||
|| | || | ||
− | |||
|| | || | ||
|- | |- | ||
Line 145: | Line 146: | ||
* GPU programming introduction | * GPU programming introduction | ||
|| | || | ||
− | |||
|| | || | ||
|- | |- | ||
Line 152: | Line 152: | ||
* Parallel computing algorithms | * Parallel computing algorithms | ||
|| | || | ||
− | |||
|| | || | ||
|- | |- | ||
Line 159: | Line 158: | ||
|| | || | ||
[CE] Parallel Programming with CUDA<br> | [CE] Parallel Programming with CUDA<br> | ||
+ | [[:File:Coe163 2020s2 CE.pdf | [CE] Specifications]]<br> | ||
[https://uvle.upd.edu.ph/mod/assign/view.php?id=480128 <nowiki>[CE] Submission bin</nowiki>]<br> | [https://uvle.upd.edu.ph/mod/assign/view.php?id=480128 <nowiki>[CE] Submission bin</nowiki>]<br> | ||
[https://colab.research.google.com/drive/1jjzPTP0QAMLcmiIGJFY_dXxdaGozkHvx <nowiki>[CE] Jupyter notebook</nowiki>]<br> | [https://colab.research.google.com/drive/1jjzPTP0QAMLcmiIGJFY_dXxdaGozkHvx <nowiki>[CE] Jupyter notebook</nowiki>]<br> |
Revision as of 02:05, 25 June 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 M. Austria [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, edX, Google Meet, Zoom, other quiz platforms.
Course Outline
Week | Topics | Academic Requirements | Resource Links |
---|---|---|---|
0 |
|
||
1 |
|
[SQ01] CS problems |
|
2 |
|
[SQ02] Asymptotic analysis |
[02a slides] |
3 |
|
[ME01] Solving and profiling |
[03a slides] |
4 |
|
||
5 |
|
[SQ03] Caching in MMM [ME02] MMM Loop Ordering |
|
6 |
|
[ME03] BLAS |
|
7 |
|
[SQ04] Matrix Factorization and Sparse Matrices |
|
8 |
|
||
9 |
|
||
10 |
|
||
11 |
|
||
12 |
[CE] Parallel Programming with CUDA |
Grading Rubric
40% Short quizzes
35% Machine exercises
25% Capstone exercise
55% Short quizzes
45% Machine exercises
10% Capstone exercies