Difference between revisions of "CoE 163 S2 AY 2021-2022"

From Microlab Classes
Jump to navigation Jump to search
m (Updated grading rubric)
Line 15: Line 15:
 
* Darvy P. Ong [darvy.ong at eeemail]
 
* Darvy P. Ong [darvy.ong at eeemail]
 
* Nestor Michael C. Tiglao [nestor at eeemail]
 
* Nestor Michael C. Tiglao [nestor at eeemail]
 +
'''Student Assistants''':
 +
* Brian Bascos
 +
* Christian Eric Cosca
 +
* Jean Abigail de Padua
 
'''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.
 
'''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.
 
<br>
 
<br>
Line 34: Line 38:
 
|
 
|
 
|  
 
|  
[[:File:Coe163 2020s2 Syllabus.pdf | [guide]]]<br>
+
[[:File:Coe163 2s2122 syllabus.pdf | [guide]]]<br>
[[:File:Coe163 2020s2 00 about.pdf | [00 slides]]]
+
[[:File:Coe163 2s2122 00 about.pdf | [00 slides]]]
 
|-
 
|-
 
| 1
 
| 1
Line 42: Line 46:
 
* [01b] Problem identification and solving
 
* [01b] Problem identification and solving
 
|
 
|
[SQW01] CS problems<br>
+
[SQ01] CS problems<br>
[<nowiki>[SQW01] Submission bin</nowiki>]<br>
+
[https://uvle.upd.edu.ph/mod/quiz/view.php?id=156604 <nowiki>[SQ01] Quiz</nowiki>]<br>
 
|
 
|
[[:File:Coe163 2020s2 01a review algorithms.pdf | [01a slides]]]<br>
+
[[:File:Coe163 2s2122 01a review algorithms.pdf | [01a slides]]]<br>
[[:File:Coe163 2020s2 01b problem solving.pdf | [01b slides]]]
+
[[:File:Coe163 2s2122 01b problem solving.pdf | [01b slides]]]
 
|-
 
|-
 
| 2
 
| 2
Line 52: Line 56:
 
* [02a] Review of asymptotic analysis
 
* [02a] Review of asymptotic analysis
 
* [02b] Amortized analysis
 
* [02b] Amortized analysis
* [02c] High-level code translation to memory
+
* [02c] High-level optimization
 
|
 
|
[SEW02] Asymptotic analysis<br>
+
[SQ02] Asymptotic analysis<br>
[<nowiki>[SEW02] Submission bin</nowiki>]<br>
+
[https://uvle.upd.edu.ph/mod/quiz/view.php?id=156608 <nowiki>[SQ02] Quiz</nowiki>]<br>
 
|
 
|
[[:File:Coe163 2020s2 02a review asymptotic.pdf | [02a slides]]]<br>
+
[[:File:Coe163 2s2122 02a review asymptotic.pdf | [02a slides]]]<br>
[[:File:Coe163 2020s2 02b amortized analysis.pdf | [02b slides]]]<br>
+
[[:File:Coe163 2s2122 02b amortized analysis.pdf | [02b slides]]]<br>
[02c slides]
+
[[:File:Coe163 2s2122 02c high level optimization.pdf | [02c slides]]]
 
|-
 
|-
 
| 3
 
| 3
 
|
 
|
* [03a] Programming languages survey
+
* [03a] Choosing a platform
* [03b] Matching programming languages and problems
+
* [03b] x86 assembly introduction
* [03c] Introduction to x86 assembly
+
* [03c] x86 assembly reference
 
|
 
|
[SEW03] Solving and profiling<br>
+
[SE01] Profiling and assembly<br>
[[SEW03] Specifications]]<br>
+
[[:File:Coe163 2s2122 se01 profiling assembly.pdf | [SE01] Specifications]]<br>
[<nowiki>[ME01] Submission bin</nowiki>]
+
[https://uvle.upd.edu.ph/mod/assign/view.php?id=195394 <nowiki>[SE01] Submission bin</nowiki>]
 
|
 
|
[[:File:Coe163 2020s2 03a high level optimization.pdf | [03a slides]]]<br>
+
[[ | [03a slides]]]<br>
[[:File:Coe163 2020s2 03b parallel programming intro.pdf | [03b slides]]]<br>
+
[[:File:Coe163 2s2122 03b x86 assembly.pdf | [03b slides]]]<br>
 +
[[:File:Coe163 2s2122 03c x86 assembly ref.pdf | [03c slides]]]
 
|-
 
|-
 
| 4
 
| 4
Line 80: Line 85:
 
* [04c] Cache behavior of linear algebra operations
 
* [04c] Cache behavior of linear algebra operations
 
|
 
|
[SQW04] Linear algebra<br>
+
[SQ03] Linear algebra<br>
 
|
 
|
[[:File:Coe163 2020s2 04a linear algeb ops.pdf | [04a slides]]]<br>
+
[[ | [04a slides]]]<br>
[[:File:Coe163 2020s2 04b linear algeb problems.pdf | [04b slides]]]<br>
+
[[ | [04b slides]]]<br>
[[:File:Coe163 2020s2 04c linear algeb considerations.pdf | [04c slides]]]<br>
+
[[ | [04c slides]]]<br>
 
|-
 
|-
 
| 5
 
| 5
Line 92: Line 97:
 
* [05c] ATLAS (automatically-tuned linear algebra software)
 
* [05c] ATLAS (automatically-tuned linear algebra software)
 
|
 
|
[SEW05] Caching in MMM<br>
+
[SE02] Caching in MMM<br>
 
|
 
|
[[:File:Coe163 2020s2 05a cache.pdf | [05a slides]]]<br>
+
[[ | [05a slides]]]<br>
[[:File:Coe163 2020s2 05b mmm part01.pdf | [05b slides]]]<br>
+
[[ | [05b slides]]]<br>
[[:File:Coe163 2020s2 05c mmm part02.pdf | [05c slides]]]<br>
+
[[ | [05c slides]]]<br>
[[:File:Coe163 2020s2 05x study guide.pdf | [05x guide]]]<br>
+
[[ | [05x guide]]]<br>
 
|-
 
|-
 
| 6
 
| 6
Line 104: Line 109:
 
* [06b] Matrix inversion
 
* [06b] Matrix inversion
 
|
 
|
[SEW06] BLAS<br>
+
[SE03] BLAS<br>
 
|
 
|
[[:File:Coe163 2020s2 06a blas atlas.pdf | [06a slides]]]
+
[[ | [06a slides]]]
 
|-
 
|-
 
| 7
 
| 7
Line 113: Line 118:
 
* [07b] Matrix decomposition
 
* [07b] Matrix decomposition
 
|
 
|
[SQW07] Matrix Factorization and Sparse Matrices<br>
+
[SQ04] Matrix Factorization and Sparse Matrices<br>
 
|
 
|
[[:File:Coe163 2020s2 07a gaussian elim.pdf | [07a slides]]]<br>
+
[[ | [07a slides]]]<br>
[[:File:Coe163 2020s2 07b sparse mat.pdf | [07b slides]]]
+
[[ | [07b slides]]]
 
|-
 
|-
 
| 8
 
| 8
Line 131: Line 136:
 
* [10b] Limits of parallel computing
 
* [10b] Limits of parallel computing
 
|
 
|
[SQW10] Parallel programming
+
[SQ05] Parallel programming
 
|
 
|
 
|-
 
|-
Line 138: Line 143:
 
* [11a] Parallel computing algorithms
 
* [11a] Parallel computing algorithms
 
|
 
|
[SEW11] Parallel computing algorithms
+
[SE04] Parallel computing algorithms
 
|
 
|
 
|-
 
|-
Line 146: Line 151:
 
* [12b] OpenCL/OpenMP
 
* [12b] OpenCL/OpenMP
 
|
 
|
[SEW12] OpenCL/OpenMP
+
[SE05] OpenCL/OpenMP
 
|
 
|
 
|-
 
|-

Revision as of 17:05, 3 March 2022

Course Information

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

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

Instructors:

  • Isabel M. Austria [isabel.austria at eeemail]
  • Carl C. Dizon [carl.dizon at eeemail]
  • Darvy P. Ong [darvy.ong at eeemail]
  • Nestor Michael C. Tiglao [nestor at eeemail]

Student Assistants:

  • Brian Bascos
  • Christian Eric Cosca
  • Jean Abigail de Padua

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 Academic Requirements Resource Links
0
  • [00] Course overview and synopsis
  • [00] Course requirements

[guide]
[00 slides]

1
  • [01a] Review of CS data structures and algorithms
  • [01b] Problem identification and solving

[SQ01] CS problems
[SQ01] Quiz

[01a slides]
[01b slides]

2
  • [02a] Review of asymptotic analysis
  • [02b] Amortized analysis
  • [02c] High-level optimization

[SQ02] Asymptotic analysis
[SQ02] Quiz

[02a slides]
[02b slides]
[02c slides]

3
  • [03a] Choosing a platform
  • [03b] x86 assembly introduction
  • [03c] x86 assembly reference

[SE01] Profiling and assembly
[SE01] Specifications
[SE01] Submission bin

[[ | [03a slides]]]
[03b slides]
[03c slides]

4
  • [04a] Review of linear algebra operations
  • [04b] Solving problems using linear algebra
  • [04c] Cache behavior of linear algebra operations

[SQ03] Linear algebra

[[ | [04a slides]]]
[[ | [04b slides]]]
[[ | [04c slides]]]

5
  • [05a] Matrix-matrix multiplication part 01
  • [05b] Matrix-matrix multiplication part 02
  • [05c] ATLAS (automatically-tuned linear algebra software)

[SE02] Caching in MMM

[[ | [05a slides]]]
[[ | [05b slides]]]
[[ | [05c slides]]]
[[ | [05x guide]]]

6
  • [06a] Gaussian elimination
  • [06b] Matrix inversion

[SE03] BLAS

[[ | [06a slides]]]

7
  • [07a] Sparse linear algebra
  • [07b] Matrix decomposition

[SQ04] Matrix Factorization and Sparse Matrices

[[ | [07a slides]]]
[[ | [07b slides]]]

8
READING BREAK
9
LENTEN BREAK
10
  • [10a] Parallel computing concepts
  • [10b] Limits of parallel computing

[SQ05] Parallel programming

11
  • [11a] Parallel computing algorithms

[SE04] Parallel computing algorithms

12
  • [12a] Single instruction multiple data vectorization
  • [12b] OpenCL/OpenMP

[SE05] OpenCL/OpenMP

13
  • [13a] GPU programming basics
  • [13b] CUDA programming with Numba

[CE] Capstone exercise

14
READING BREAK
15
16
17
  • Finals week

Grading Rubric

32% Short quizzes
48% Software exercises
20% Capstone exercise

Announcements

February 2022