13E113KDP - Concurrent and Distributed Programming
Course specification | ||||
---|---|---|---|---|
Course title | Concurrent and Distributed Programming | |||
Acronym | 13E113KDP | |||
Study programme | Electrical Engineering and Computing | |||
Module | Computer Engineering and Informatics | |||
Type of study | bachelor academic studies | |||
Lecturer (for classes) | ||||
Lecturer/Associate (for practice) | ||||
Lecturer/Associate (for OTC) | ||||
ESPB | 6.0 | Status | mandatory | |
Condition | Programming 1, Object-Oriented Programming 2 | |||
The goal | Introducing basic concepts of concurrent and distributed programming to students. Introduction of concepts of different abstraction levels in concurrent and distributed programming. Enabling students to write concurrent and distributed programs for most common problems in different programming languages. | |||
The outcome | Understanding the basic concepts, algorithms, principles, problems, and solutions related to concurrent and distributed programming. Students should be able to identify different levels of abstraction in a concurrent and distributed programming, to independently write simple concurrent and distributed applications using Java language and to solve common problems of synchronization. | |||
Contents | ||||
URL to the subject page | https://rti.etf.bg.ac.rs/rti/ir3kdp/index.html | |||
URL to lectures | https://teams.microsoft.com/l/team/19%3ajg4fVWONTNbpNrxWoU4zDojD8oAFq-i40parCbUziS41%40thread.tacv2/conversations?groupId=41cb6bcc-c45f-4927-9cd9-0b0f6009695c&tenantId=1774ef2e-9c62-478a-8d3a-fd2a495547ba | |||
Contents of lectures | Concepts of processes and synchronization. Locks and barriers. Synchronization algorithms. Different methods of barrier implementations. Semaphores. Distributed binary semaphores, Passing the baton, resource allocation. Monitors. Conditional variables, disciplines for the signal, analysis of monitor state. Message passing. Asynchronous and synchronous message passing. Remote procedure calls. | |||
Contents of exercises | Using semaphores, monitors, regions and message passing for solving typical problems: Readers- Writers, Producers-Consumers, One Lane Bridge, Dining Philosophers, Cigarette Smokers, Sleeping Barber, Roller coaster, Client-Server, etc. Distributed programming (CSP and Linda). Implementation of semaphores, conditional regions, monitors, message passing, and remote method invocation in Java. | |||
Literature | ||||
| ||||
Number of hours per week during the semester/trimester/year | ||||
Lectures | Exercises | OTC | Study and Research | Other classes |
2 | 2 | 1 | ||
Methods of teaching | Lectures, exercises, laboratory exercises, projects | |||
Knowledge score (maximum points 100) | ||||
Pre obligations | Points | Final exam | Points | |
Activites during lectures | 0 | Test paper | 40 | |
Practical lessons | 20 | Oral examination | 0 | |
Projects | 0 | |||
Colloquia | 40 | |||
Seminars | 0 |