Title:

Parallel and Distributed Algorithms

Code:PDA
Ac.Year:ukončen 2006/2007
Term:Summer
Study plans:
ProgramBranchYearDuty
EI-MSC-3VTN3rdCompulsory
EI-MSC-5VTI2nd Stage/3rd YearCompulsory
Language:Czech
Private info:http://www.fit.vutbr.cz/study/courses/PDA/private/
Credits:6
Completion:accreditation+exam (written)
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:3900026
 ExaminationTestsExercisesLaboratoriesOther
Points:70100020
Guarantee:Hanáček Petr, doc. Dr. Ing., DITS
Lecturer:Hanáček Petr, doc. Dr. Ing., DITS
Zbořil František, Ing., Ph.D., DITS
Faculty:Faculty of Information Technology BUT
Department:Department of Intelligent Systems FIT BUT
 
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, 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.
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. Projects in the UNIX laboratory
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.
Exam prerequisites:
Projects are necessary.