Skip to main content
Skip header
Terminated in academic year 2009/2010

Parallel Algorithms

Type of study Doctoral
Language of instruction Czech
Code 456-0917/01
Abbreviation PA
Course title Parallel Algorithms
Credits 10
Coordinating department Department of Computer Science
Course coordinator RNDr. Ondřej Jakl, CSc.

Subject syllabus

Lectures:

Introduction. Motivation and historical remarks. Basic concepts.


Parallel computer systems. Flynn's classification. Interconnection subsystems.

Loosely coupled multiprocessors. Computer networks and massively parallel systems. The Termit cluster and IBM SP.

Parallel programming models. The message passing model.

Design of a parallel algorithm: decomposition, communication analysis, agglomeration, mapping to processors.

Load-balancing techniques.

Evaluation of parallel algorithms. Speedup, efficiency, cost. Amdahl's law.

Scalability of parallel applications. Isoefficiency function.

Parallel Virtual Machine (PVM). Application programming interface.

PVM (continued). Overview of library routines: process control, information retrieval, message passing,
etc.


PVM (continued). Collective communication. Debugging issues. Visualization of a parallel execution.

Selected algorithms in a chosen application area and their parallelization.

Introduction to the Message Passing Interface (MPI). Comparison with PVM, advanced features.

Programming of symmetric multiprocessors. Threads and OpenMP.

Current developments in high performance computing.

Literature

No literature has been specified for this subject.

Advised literature

No advised literature has been specified for this subject.