Course: Parallel and Distributed Systems

« Back
Course title Parallel and Distributed Systems
Course code KMI/PDS
Organizational form of instruction Lecture + Lesson
Level of course Master
Year of study not specified
Semester Winter
Number of ECTS credits 5
Language of instruction Czech
Status of course Compulsory
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Motyčková Lenka, doc. Ing. CSc.
Course content
Parallel computational models. Parallel algorithm history. Programming logic. Proof of critical section problem. Barriers - complexity and correctness. Application of semaphors in Readers and writers, Dining philosphers, Cigarret Smokers problem solution. Distributed computational model, global snapshot. Logical time. Mutual exclusion in distributed systems. Deadlock and termination detection.

Learning activities and teaching methods
Lecture, Demonstration
Learning outcomes
The students become familiar with complexity of basic concepts of parallel and distributed systems, teir complexity and correctness.
Comprehention: Design correct parallel or distributed algorithm.
Prerequisites
unspecified

Assessment methods and criteria
Oral exam, Written exam

Active participation in class. Completion of assigned homeworks. Passing the oral and written exam.
Recommended literature
  • ANDREWS G. R. (2000). Multithreaded, Parallel, and Distributed Programming. Addison-Wesley.
  • Baer Galvin, Greg Gagne and A Silberschatz . Operating System Concepts.
  • Kenneth A. Berman, Jerome L. Paul . Algorithms-Sequential-Parallel-and-Distributed.
  • Tel G. (2001). Introduction to Distributed Algorithms. Cambridge University Press.


Study plans that include the course
Faculty Study plan (Version) Branch of study Category Recommended year of study Recommended semester
Faculty of Science Applied Computer Science (1) Informatics courses 1 Winter
Faculty of Science Computer Science (2015) Informatics courses 1 Winter