Operating Systems

The course is not on the list Without time-table
Code Completion Credits Range Language
BIE-OSY.21 Z,ZK 5 2P+1R+1L English
Garant předmětu:
Department of Computer Systems

In this course that is a follow-up of the Unix-like operating systems course students deepen their knowledge in areas of OS kernels, process and thread implementations, race conditions, critical regions, thread scheduling, shared resource allocation and deadlocks, management of virtual memory and data storages, file systems, OS monitoring. They are able to design and implement simple multithreaded applications. General principles are illustrated on operating systems Solaris, Linux, or MS Windows.


Common user-level knowledge of operating systems. Basic knowledge of C/C++ programming.

Syllabus of lectures:

1. Introduction, OS architecture and functionalities, taxonomy of computing systems.

2. Processes and threads. Thread scheduling, context switching, thread states. Race conditions.

3. Thread synchronization - critical regions, busy waiting, mutexes, semaphores, conditional variables, synchronization producer-consumer problem, barriers.

4. Classical synchronization tasks and their solutions.

5. Allocation of shared resources - deadlocks, Coffman's conditions, strategies for deadlock solving.

6. Process/thread implementation. Thread scheduling.

7. Main memory management - virtual memory, memory allocation using dynamic partitioning.

8. Main memory management - virtual memory implemented using paging and segmentation.

9. Main memory management - page replacement algorithms.

10. Data storages - disks, RAID systems, connections to the host computer.

11. File systems - implementations of classical file systems.

12. File systems - implementation in the OS kernel, modern file systems and their advanced functions.

13. Tools for monitoring of OSs.

Syllabus of tutorials:

1. Programs with multiple threads.

2. Thread synchronisation I. (mutex, condition variables).

3. Thread synchronisation II. (semaphores, barriers).

4. Processes (fork(), exec(),...).

5. Deadlock, physical and virtual memory.

6. Page replacement algorithms.

Study Objective:

The course is an introduction into the classical operating system theory. The aim is to get students acquainted with the fundamental theory and concepts of operating systems and apply this theoretical knowledge for operating system administration. After completing the course, students will be able to design and implement multithreaded applications.

Study materials:

1. Tanenbaum A. S. : Modern Operating Systems (4th Edition). Pearson, 2016. ISBN 978-0133591620.

2. Silberschatz A., Gagne G., Galvin P.B. : Operating System Concepts (10th Edition). Wiley, 2018. ISBN 978-1119456339.

3. Anderson T., Dahlin M. : Operating Systems: Principles and Practice (2nd Edition). Recursive Books, 2014. ISBN 978-0985673529.

4. Stallings W. : Operating Systems: Internals and Design Principles (9th Edition). Pearson, 2017. ISBN 978-0134670959.

5. Arpaci-Dusseau R.H., Arpaci-Dusseau A.C. : Operating Systems: Three Easy Pieces. CreateSpace Independent Publishing Platform, 2018. ISBN 978-1985086593.

Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2024-06-16
Aktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet6698406.html