Course details

Parallel and Distributed Algorithms

PRL Acad. year 2019/2020 Summer semester 5 credits

Current academic year

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

Hanáček Petr, doc. Dr. Ing. (DITS)

Course coordinator

Zbořil František, doc. 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 (written part)
  • 10 pts mid-term test (written part)
  • 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

Vídeňský František, Ing. (DITS)

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.

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.

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.

Study literature

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

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.
Exam prerequisites:
To obtain at least one point in each project and at least 10 points from semester activities.

Controlled instruction

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.

Exam prerequisites

To obtain at least one point in each project and at least 10 points from semester activities.

Course inclusion in study plans

Back to top