| 1. |
Modern computing environments |
Review the C programming language |
190minutes |
| 2. |
Matrix storage and matrix multiplication |
Review linear algebra |
190minutes |
| 3. |
Sparse matrix storage and computation |
Review linear algebra |
190minutes |
| 4. |
Sorting algorithms: selection sort, bubble sort, bucket sort |
Review C programming |
190minutes |
| 5. |
Sorting algorithms: radix sort, quicksort |
Review C programming |
190minutes |
| 6. |
Divide-and-conquer algorithms |
Review linear algebra |
190minutes |
| 7. |
Midterm examination and review |
Review the material from Lectures 1–6 |
190minutes |
| 8. |
OpenMP: introduction and sections construct |
Review the C programming language |
190minutes |
| 9. |
OpenMP: parallelization of for-loops |
Review the notes and materials from the previous lecture |
190minutes |
| 10. |
Parallel efficiency: weak scaling and strong scaling |
Review the notes and materials from the previous lecture; review recursive procedures |
190minutes |
| 11. |
Practical exercise: parallelization of matrix multiplication |
Review algorithms and computational complexity |
190minutes |
| 12. |
Numerical accuracy in numerical computation |
Review binary representation |
190minutes |
| 13. |
Programming in advanced computing environments |
Review MATLAB |
190minutes |
| 14. |
Summary and final examination |
Review all course materials |
190minutes |
| Total. |
- |
- |
2660minutes |