Title:

Parallel and Distributed Algorithms

Code:PRL
Ac.Year:2006/2007
Term:Summer
Study plans:
ProgramBranchYearDuty
IT-MSC-2MGM.2ndElective
IT-MSC-2MIN.1stCompulsory
IT-MSC-2MIS.1stCompulsory
IT-MSC-2MPS-Elective
IT-MSC-2EITE1stCompulsory
Language:Czech
Private info:http://www.fit.vutbr.cz/study/courses/PRL/private/
Credits:5
Completion:accreditation+exam (written)
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:3900013
 ExaminationTestsExercisesLaboratoriesOther
Points:70100020
Guarantee:Hanáček Petr, doc. Dr. Ing., DITS
Lecturer:Hanáček Petr, doc. Dr. Ing., DITS
Faculty:Faculty of Information Technology BUT
Department:Department of Intelligent Systems FIT BUT
Substitute for:
Parallel and Distributed Algorithms (PDA), DITS
 
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:
  1. Introduction, architectures and languages for parallel and distributed processing.
  2. Abstract models of parallel computing, PRAM (Parallel Random Access Machine).
  3. Distributed and parallel algorithms and their complexity.
  4. Interaction between processes, communication, synchronization.
  5. Topologie, synchrinous and asynchronous algorithms.
  6. Algorithms for parallel sorting.
  7. Algorithms for parallel searching.
  8. Parallel matrix operations.
  9. All prefix sums and their applications.
  10. Graph and list algorithms.
  11. Synchronization algorithms and tasks.
  12. Mechanisms and language constructs for synchronization.
  13. Languages for parallel and distributed computing.
Syllabus of laboratory exercises:
  1. Samostatně řešené projekty
Syllabus - others, projects and individual work of students:
  1. Programming project in parallel programming language.
Fundamental literature:
  1. Jaja, J.: An Introduction to Parallel Algorithms, Addison-Wesley, 1992, ISBN 0-201-54856-9
  2. Akl, S.: The Design and Analysis of Parallel Algorithms, Prentice-Hall International, ISBN 0-13-200073-3
Study literature:
  1. Tvrdík, P.: Parallel Systems and Algorithms, skripta, Praha, Vydavatelství ČVUT 1997.
Controlled instruction:
A written mid-term exam, a regular evaluation of projects.
Progress assessment:
A mid-term exam evaluation and an evaluation of projects.
Exam prerequisites:
Projects are necessary.