Course details

Parallel and Distributed Algorithms

PDA Acad. year 2005/2006 Winter semester 6 credits

Current academic year

Introduction, architectures and languages for parallel and distributed. Abstract models of parallel computing, PRAM (Parallel Random Access Machine), 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)

Language of instruction

Czech

Completion

Credit+Examination

Time span

  • 39 hrs lectures
  • 26 hrs projects

Department

Department of Intelligent Systems (UITS)

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.

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

Progress assessment

Projects are necessary.

Controlled instruction

Mid-term exam

Back to top