Course detail

Parallel and Distributed Algorithms

FIT-PRLAcad. year: 2019/2020

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

Czech

Number of ECTS credits

5

Mode of study

Not applicable.

Guarantor

doc. Dr. Ing. Petr Hanáček

Department

Department of Intelligent Systems (UITS)

Learning outcomes of the course unit

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.

Prerequisites

Basic knowledge of algorithms.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Not applicable.

Assesment methods and criteria linked to learning outcomes

A mid-term exam evaluation and an evaluation of projects.
Exam prerequisites:
To obtain at least one point in each project and at least 10 points from semester activities.

Course curriculum

Not applicable.

Work placements

Not applicable.

Aims

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.

Specification of controlled education, way of implementation and compensation for absences

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.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Not applicable.

Recommended reading

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
Andrew Adamatzky, Selim Akl, Georgios Ch. Sirakoulis: From Parallel to Emergent Computing, CRC Press, 2019, ISBN 9781138054011
Jaja, J.: An Introduction to Parallel Algorithms, Addison-Wesley, 1992, ISBN 0-201-54856-9
Reif, J: Synthesis of Parallel Algorithms, Morgan Kaufmann, 1993, ISBN:155860135X
Tvrdík, P.: Parallel Systems and Algorithms, skripta, Praha, Vydavatelství ČVUT 1997.

Classification of course in study plans

  • Programme IT-MSC-2 Master's

    branch MMI , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    branch MBI , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    branch MSK , 1 year of study, summer semester, compulsory, profile core courses
    branch MMM , 0 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    branch MBS , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    branch MPV , 0 year of study, summer semester, compulsory-optional
    branch MIS , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    branch MIN , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    branch MGM , 0 year of study, summer semester, compulsory-optional

  • Programme MITAI Master's

    specialization NBIO , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NSEN , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NVIZ , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NGRI , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NISD , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NSEC , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NCPS , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NHPC , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NNET , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NMAL , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NVER , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NIDE , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NEMB , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NSPE , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NADE , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NMAT , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core
    specialization NISY , 1 year of study, summer semester, compulsory, fundamental theoretical courses of the profile core

Type of course unit

 

Lecture

39 hod., optionally

Teacher / Lecturer

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

Syllabus

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

Project

13 hod., compulsory

Teacher / Lecturer

Ing. František Vídeňský

Syllabus

  1. Programming project in parallel programming language.