Parallel and Distributed Algorithms
PRL Acad. year 2022/2023 Summer semester 5 credits
Introduction, features and languages for parallel and distributed architectures. Abstract models of parallel computing, PRAM, complexity. All prefix sums and their applications. Algorithms for parallel sorting and searching, parallel matrix operations, Interaction between processes, communication, synchronization. Typical problems.
Language of instruction
- 39 hrs lectures
- 13 hrs projects
- 70 pts final exam
- 10 pts mid-term test
- 20 pts projects
Subject specific learning outcomes and competences
Students will learn basic principles of parallel and distributed computing and with parallel and distributed algorithms and their time complexity.
Students will learn basic principles and possibilities of algorithm parallelization.
To acquaint students with the with the basic concepts of parallel and distributed computing. The course aims to the general principles of parallel and distributed algorithms and their time complexity.
Why is the course taught
The aim of this course is to teach students to make parallel algorithmic solution to basic tasks like sorting, searching, list processing etc. Also the students will be able to create correct parallel and distributed applications and to use synchronization mechanisms properly.
Prerequisite knowledge and skills
Basic knowledge of algorithms.
- Reif, J: Synthesis of Parallel Algorithms, Morgan Kaufmann, 1993, ISBN:155860135X
- Akl, S.: The Design and Analysis of Parallel Algorithms, Prentice-Hall International, ISBN 0-13-200073-3
- Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar: Introduction to Parallel Computing, Addison Wesley, 2003, ISBN: 0-201-64865-2
- Jaja, J.: An Introduction to Parallel Algorithms, Addison-Wesley, 1992, ISBN 0-201-54856-9
Syllabus of lectures
- Introduction, architectures and languages for parallel and distributed processing.
- Abstract models of parallel computing, PRAM (Parallel Random Access Machine).
- Distributed and parallel algorithms and their complexity.
- Interaction between processes, communication, synchronization.
- Topologies, synchronous and asynchronous algorithms.
- Algorithms for parallel sorting.
- Algorithms for parallel searching.
- Parallel matrix operations.
- All prefix sums and their applications.
- Graph and list algorithms.
- Synchronization algorithms and tasks.
- Mechanisms and language constructs for synchronization.
- Languages for parallel and distributed computing.
Syllabus - others, projects and individual work of students
- Programming project in parallel programming language.
A mid-term exam evaluation and an evaluation of projects.
A written mid-term test, a regular evaluation of projects. The test does not have correction option, the final exam has two possible correction terms.
To obtain at least one point in each project and at least 15 points from semester activities.
|Wed||lecture||1., 3., 4., 5., 6., 7. of lectures||E104 E105 E112||14:00||16:50||9999||1MIT 2MIT||NBIO - NSPE xx||Hanáček|
|Wed||lecture||2., 8., 9., 11., 12., 13. of lectures||E104 E105 E112||14:00||16:50||9999||1MIT 2MIT||NBIO - NSPE xx||Zbořil|
|Wed||lecture||2023-04-12||D0206||14:00||16:50||9999||1MIT 2MIT||NBIO - NSPE xx||Zbořil|
Course inclusion in study plans
- Programme IT-MGR-2, field MBI, MBS, MIN, MIS, MSK, 1st year of study, Compulsory
- Programme IT-MGR-2, field MGM, MPV, any year of study, Compulsory-Elective group M
- Programme IT-MGR-2, field MMM, any year of study, Compulsory
- Programme MITAI, field NADE, NBIO, NCPS, NEMB, NEMB up to 2021/22, NGRI, NHPC, NIDE, NISD, NISY, NISY up to 2020/21, NMAL, NMAT, NNET, NSEC, NSEN, NSPE, NVER, NVIZ, 1st year of study, Compulsory