Course detail

Parallel and Distributed Algorithms

FIT-PRLAcad. year: 2018/2019

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.

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.

Recommended optional programme components

Not applicable.

Recommended or required reading

  • Akl, S.: The Design and Analysis of Parallel Algorithms, Prentice-Hall International, ISBN 0-13-200073-3
  • 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
  • Jaja, J.: An Introduction to Parallel Algorithms, Addison-Wesley, 1992, ISBN 0-201-54856-9
  • Tvrdík, P.: Parallel Systems and Algorithms, skripta, Praha, Vydavatelství ČVUT 1997.

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 15 points from semester activities.

Language of instruction

Czech

Work placements

Not applicable.

Course curriculum

    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 of laboratory exercises:
    • Samostatně řešené projekty

    Syllabus - others, projects and individual work of students:
    1. Programming project in parallel programming language.

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.

Classification of course in study plans

  • Programme IT-MGR-2 Master's

    branch MPV , any year of study, summer semester, 5 credits, compulsory-optional
    branch MGM , any year of study, summer semester, 5 credits, compulsory-optional
    branch MMM , any year of study, summer semester, 5 credits, compulsory
    branch MBI , 1. year of study, summer semester, 5 credits, compulsory
    branch MSK , 1. year of study, summer semester, 5 credits, compulsory
    branch MIS , 1. year of study, summer semester, 5 credits, compulsory
    branch MBS , 1. year of study, summer semester, 5 credits, compulsory
    branch MIN , 1. year of study, summer semester, 5 credits, compulsory
    branch MMI , 1. year of study, summer semester, 5 credits, compulsory

Type of course unit

 

Lecture

39 hours, optionally

Teacher / Lecturer

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 hours, compulsory

Teacher / Lecturer

Syllabus


  1. Programming project in parallel programming language.

eLearning