Course details

Parallel and Distributed Algorithms

PRL Acad. year 2024/2025 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.

Guarantor

Zbořil František, doc. Ing., Ph.D. (DITS)

Course coordinator

Veigend Petr, Ing., Ph.D. (DITS)

Language of instruction

Czech

Completion

Credit+Examination (written)

Time span

  • 39 hrs lectures
  • 13 hrs projects

Assessment points

  • 70 pts final exam
  • 10 pts mid-term test
  • 20 pts projects

Department

Department of Intelligent Systems (UITS)

Lecturer

Hanáček Petr, doc. Dr. Ing. (DITS)
Zbořil František, doc. Ing., Ph.D. (DITS)

Instructor

Veigend Petr, Ing., Ph.D. (DITS)

Learning objectives

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.
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.

Prerequisite knowledge and skills

Basic knowledge of algorithms.

Study literature

  • 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

  1. Programming project in parallel programming language.

Progress assessment

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.

Prerequisites to obtain a credit
To obtain at least one point in each project and at least 15 points from semester activities.

Schedule

DayTypeWeeksRoomStartEndCapacityLect.grpGroupsInfo
Wed lecture 1., 2., 3., 5., 6., 7., 8., 9., 10., 11., 12., 13. of lectures E104 E105 E112 13:0015:50294 1MIT 2MIT NBIO - NSPE xx Zbořil
Wed lecture 2025-03-05 E104 E105 E112 13:0015:50294 1MIT 2MIT NBIO - NSPE xx Hanáček

Course inclusion in study plans

Back to top