Operating Systems

Course guarantor:

Lecturer:

Tutor:

Supervisor:

Department of Computer Systems

Synopsis:

Students understand the classical theory of operating systems (OS) in addition to the knowledge gained in the module „Programming in Shell 1“. They get a solid knowledge of OS kernels, processes and threads implementations. They understand the problems of race conditions, thread scheduling, resource allocation and deadlocks, the techniques of the management of virtual memory, principles and architectures of disks, RAID and file systems. They are able to design and implement simple multithreaded applications.

Requirements:

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.

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:

Students gain basic knowledge necessary for developing system applications or for system administration. After completing the course, students will be able to design and implement simple multithreaded applications.

Study materials:

1. Tanenbaum, A. S. ''Modern Operating Systems (2nd Edition)''. Prentice Hall, 2001. ISBN 0130313580.

2. Stallings, W. ''Operating Systems: Internals and Design Principles (5th Edition)''. Prentice Hall, 2004. ISBN 0131479547.

3. Silberschatz, A., Galvin, P. B., Gagne, G. ''Operating System Concepts (7th Edition)''. Wiley, 2004. ISBN 0471694665.

Note:

Further information:

https://courses.fit.cvut.cz/BI-OSY/

No time-table has been prepared for this course

The course is a part of the following study plans:

• Bachelor program Informatics, unspecified branch, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Security and Information Technology, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Computer Science, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Computer Engineering, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Information Systems and Management, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Web and Software Engineering, spec. Software Engineering, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Web and Software Engineering, spec. Web Engineering, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Web and Software Engineering, spec. Computer Graphics, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Knowledge Engineering, in Czech, 2018-2020 (compulsory course in the program)