Course details

Parallel and Distributed Algorithms

PDA Acad. year 2003/2004 Winter semester 6 credits

Current academic year

Introduction, architectures and languages for parallel and distributed. 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.

Details ...

Guarantor

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

Language of instruction

Czech

Completion

Credit+Examination

Time span

Department

Faculty of Information Technology (FIT)

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

The goal is to make students familiar 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.

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

Course inclusion in study plans

Back to top