Title:

Parallel and Distributed Algorithms

Code:PRL
Ac.Year:2019/2020
Sem:Summer
Curriculums:
ProgrammeField/
Specialization
YearDuty
IT-MSC-2MBI1stCompulsory
IT-MSC-2MBS1stCompulsory
IT-MSC-2MGM-Compulsory-Elective - group M
IT-MSC-2MIN1stCompulsory
IT-MSC-2MIS1stCompulsory
IT-MSC-2MMI1stCompulsory
IT-MSC-2MMM-Compulsory
IT-MSC-2MPV-Compulsory-Elective - group M
IT-MSC-2MSK1stCompulsory
MITAINADE1stCompulsory
MITAINBIO1stCompulsory
MITAINCPS1stCompulsory
MITAINEMB1stCompulsory
MITAINGRI1stCompulsory
MITAINHPC1stCompulsory
MITAINIDE1stCompulsory
MITAINISD1stCompulsory
MITAINISY1stCompulsory
MITAINMAL1stCompulsory
MITAINMAT1stCompulsory
MITAINNET1stCompulsory
MITAINSEC1stCompulsory
MITAINSEN1stCompulsory
MITAINSPE1stCompulsory
MITAINVER1stCompulsory
MITAINVIZ1stCompulsory
Language of Instruction:Czech
Private info:http://www.fit.vutbr.cz/study/courses/PRL/private/
Credits:5
Completion:credit+exam (written)
Type of
instruction:
Hour/semLecturesSeminar
Exercises
Laboratory
Exercises
Computer
Exercises
Other
Hours:3900013
 ExamsTestsExercisesLaboratoriesOther
Points:70100020
Guarantor:Hanáček Petr, doc. Dr. Ing. (DITS)
Deputy guarantor:Zbořil František, doc. Ing., Ph.D. (DITS)
Lecturer:Hanáček Petr, doc. Dr. Ing. (DITS)
Zbořil František, doc. Ing., Ph.D. (DITS)
Instructor:Snášelová Petra, Ing. (DITS)
Faculty:Faculty of Information Technology BUT
Department:Department of Intelligent Systems FIT BUT
Substitute for:
Parallel and Distributed Algorithms (PDA), DITS
Schedule:
DayLessonWeekRoomStartEndLect.Gr.Groups
WedlecturelecturesE104 E105 E112 16:0018:501MIT 2MIT MBI - MBS MIN - MMM MSK xx
 
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 competencies:
  Students will learn basic principles of parallel and distributed computing and with parallel and distributed algorithms and their time complexity.
Generic learning outcomes and competencies:
  Students will learn basic principles and possibilities of algorithm parallelization.
Why is the course taught:
  The aim of this course is to teach students to make parallel algorithmic solution to basic tasks like sorting, searching, list processing etc. Also the students will be able to create correct parallel and distributed applications and to use synchronization mechanisms properly.
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.
  • Topologies, synchronous 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:
 
  1. Programming project in parallel programming language.
Fundamental literature:
 
  • Akl, S.: The Design and Analysis of Parallel Algorithms, Prentice-Hall International, ISBN 0-13-200073-3
  • Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar: Introduction to Parallel Computing, Addison Wesley, 2003, ISBN: 0-201-64865-2
  • Jaja, J.: An Introduction to Parallel Algorithms, Addison-Wesley, 1992, ISBN 0-201-54856-9
  • Tvrdík, P.: Parallel Systems and Algorithms, skripta, Praha, Vydavatelství ČVUT 1997.
Study literature:
 
  • Akl, S.: The Design and Analysis of Parallel Algorithms, Prentice-Hall International, ISBN 0-13-200073-3
  • Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar: Introduction to Parallel Computing, Addison Wesley, 2003, ISBN: 0-201-64865-2
  • Reif, J: Synthesis of Parallel Algorithms, Morgan Kaufmann, 1993, ISBN:155860135X
  • Andrew Adamatzky, Selim Akl, Georgios Ch. Sirakoulis: From Parallel to Emergent Computing, CRC Press, 2019, ISBN 9781138054011
Controlled instruction:
  A written mid-term test, a regular evaluation of projects. The test does not have correction option, the final exam has two possible correction terms.
Progress assessment:
  A mid-term 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.
 

Your IPv4 address: 54.211.135.32