Parallel Algorithms and Architectures

Garant předmětu:

Lecturer:

Tutor:

Supervisor:

Department of Mathematics

Synopsis:

1.Introduction

2.Optimizations

3.Sequential architectures – memory subsystem

4.Sequential architectures – instructions processing

5.Vektorization

6.Architectures with shared memory

7.NUMA architectures with shared memory

8.Introduction to CUDA

9.Architectures with distributed memory

10.Introduction to MPI

11.Parallel architectures - summary

12.Parallel algorithms – introduction and analysis

13.Basic operations

14.Sorting algorithms

15.Linear algebra

16.Graph algorithms

Requirements:

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Study materials:

Key references:

[1] Grama A., Karypis G., An Introduction to Parallel Computing: Design and Analysis of Algorithms, Pearson, 2003

[2] Storti D., Yurtoglu M., CUDA for Engineers: An Introduction to High-Performance Parallel Computing, Addison Wesley Professional, 2015.

Recommended references:

[3] CUDA Programming guide, https://docs.nvidia.com/cuda/cuda-c-programming-guide/index.html

Media and tools:

Computer lab

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans: