Faculty of Information Technology, BUT

Course details

Parallel and Distributed Algorithms

PRL Acad. year 2007/2008 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

Language of instruction

Czech

Completion

Credit+Examination (written)

Time span

39 hrs lectures, 13 hrs projects

Assessment points

70 exam, 10 half-term test, 20 projects

Department

Lecturer

Instructor

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.

Generic learning outcomes and competences

Students will learn basic principles and possibilities of algorithm paralelization.

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.

Prerequisite kwnowledge and skills

Basic knowledge of algorithms.

Study literature

  • Tvrdík, P.: Parallel Systems and Algorithms, skripta, Praha, Vydavatelství ČVUT 1997.

Fundamental literature

  • Jaja, J.: An Introduction to Parallel Algorithms, Addison-Wesley, 1992, ISBN 0-201-54856-9
  • Akl, S.: The Design and Analysis of Parallel Algorithms, Prentice-Hall International, ISBN 0-13-200073-3

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.
  • Topologie, synchrinous 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.

Controlled instruction

A written mid-term exam, a regular evaluation of projects.

Exam prerequisites

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

Course inclusion in study plans

Back to top