Title:  Parallel and Distributed Algorithms 

Code:  PRL 

Ac.Year:  2011/2012 

Term:  Summer 

Curriculums:  

Language:  Czech 

Private info:  http://www.fit.vutbr.cz/study/courses/PRL/private/ 

Credits:  5 

Completion:  accreditation+exam (written) 

Type of instruction:  Hour/sem  Lectures  Sem. Exercises  Lab. exercises  Comp. exercises  Other 

Hours:  39  0  0  0  13 

 Examination  Tests  Exercises  Laboratories  Other 

Points:  70  10  0  0  20 



Guarantee:  Hanáček Petr, doc. Dr. Ing., DITS 

Lecturer:  Hanáček Petr, doc. Dr. Ing., DITS 
Instructor:  Fajkus Jan, Ing., DITS Tomec Martin, Ing., DITS Zbořil František, doc. Ing., Ph.D., DITS Žák Jakub, Ing., DITS 

Faculty:  Faculty of Information Technology BUT 

Department:  Department of Intelligent Systems FIT BUT 

Substitute for:  


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. 
Description: 

  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. 
Knowledge and skills required for the course: 

  Basic knowledge of algorithms. 
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. 
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 of laboratory exercises: 


 Samostatně řešené projekty

Syllabus  others, projects and individual work of students: 


 Programming project in parallel programming language.

Fundamental literature: 


 Akl, S.: The Design and Analysis of Parallel Algorithms, PrenticeHall International, ISBN 0132000733
 Jaja, J.: An Introduction to Parallel Algorithms, AddisonWesley, 1992, ISBN 0201548569
 Tvrdík, P.: Parallel Systems and Algorithms, skripta, Praha, Vydavatelství ČVUT 1997.

Study literature: 


 Akl, S.: The Design and Analysis of Parallel Algorithms, PrenticeHall International, ISBN 0132000733
 Reif, J: Synthesis of Parallel Algorithms, Morgan Kaufmann, 1993, ISBN:155860135X

Controlled instruction: 

  A written midterm exam, a regular evaluation of projects. 
Progress assessment: 

  A midterm exam evaluation and an evaluation of projects. 
Exam prerequisites: 

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