Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles                Instructions

A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.

BI-OSY Operating Systems Extent of teaching: 2P+1R+1L
Instructor: Completion: Z,ZK
Department: 18104 Credits: 5 Semester: L

Annotation:
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.

Lecture syllabus:
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.

Seminar syllabus:
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.

Literature:
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.

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

Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/BI-OSY/

The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester
BI-SPOL.2015 Unspecified Branch/Specialisation of Study PP 4
BI-WSI-PG.2015 Web and Software Engineering PP 4
BI-WSI-WI.2015 Web and Software Engineering PP 4
BI-WSI-SI.2015 Web and Software Engineering PP 4
BI-ISM.2015 Information Systems and Management PP 4
BI-ZI.2018 Knowledge Engineering PP 4
BI-PI.2015 Computer engineering PP 4
BI-TI.2015 Computer Science PP 4
BI-BIT.2015 Computer Security and Information technology PP 4


Page updated 23. 4. 2024, semester: Z/2024-5, Z,L/2022-3, Z/2019-20, Z,L/2021-2, Z,L/2023-4, L/2019-20, Z,L/2020-1, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška