Course detail
Advanced Operating Systems
FIT-POSAcad. year: 2017/2018
Basic concepts, operating system kernel, kernel structure. Parallel programming and synchronization with a view to kernel synchronization. Deadlock, deadlock detection and prevention. Scheduling algorithms for uni-processor systems. Memory management, virtual memory, paging, virtual memory implementation. Input/Output, synchronous and asynchronous I/O, drivers, optimization of disk operations, File systems, disk space allocation, metadata structures, failure recovery, file system examples. Security and protection.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Learning outcomes of the course unit
A deeper understanding of computer systems and system programming.
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
- Syllabus of lectures:
- Kernel structure, interface, system calls, context switch, interrupts, system interface, Unix systems interface, standardization, SVID, XPG.
- Processes and POSIX threads, creating processes and threads, threads implementation.
- Parallel programming, synchronization, synchronization basics, mutual exclusion using memory read&write.
- Synchronization using special instructions on uni-processor and multiprocessor systems with shared memory, priority inversion and solution.
- Synchronization tools and programming languages frameworks, classical synchronization tasks and their solutions.
- Processor scheduling, strategy, implementation, scheduling algorithms for uni-processor systems.
- Resource allocation, deadlock, deadlock avoidance, solutions for CR and SR systems.
- Memory architecture, paging, page tables and TLB.
- Virtual memory, paging algorithm, page replacement algorithms.
- Practical aspects of virtual memory - code sharing, memory sharing, locking, dynamic libraries, file mapping, kernel memory.
- Input and output, drivers, synchronous and asynchronous operations, disk I/O optimization.
- Files systems, organization, space allocation, free space allocation, failure recovery, Unix file systems, BSD FFS and log based file systems.
- Security and protection, system access, data protection, security risks.
- Threads and synchronization.
- Message passing in Unix.
- Signals and signal handling.
Syllabus - others, projects and individual work of students:
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
- recommended prerequisite
Hardware/Software Codesign
Basic literature
Recommended reading
Classification of course in study plans
- Programme IT-MSC-2 Master's
branch MMI , 0 year of study, summer semester, compulsory-optional
branch MBI , 0 year of study, summer semester, compulsory-optional
branch MSK , 1 year of study, summer semester, compulsory-optional
branch MMM , 0 year of study, summer semester, elective
branch MBS , 0 year of study, summer semester, compulsory-optional
branch MPV , 0 year of study, summer semester, elective
branch MIS , 1 year of study, summer semester, compulsory
branch MIN , 0 year of study, summer semester, elective
branch MGM , 2 year of study, summer semester, elective
Type of course unit
Lecture
Teacher / Lecturer
Syllabus
- Kernel structure, interface, system calls, context switch, interrupts, system interface, Unix systems interface, standardization, SVID, XPG.
- Processes and POSIX threads, creating processes and threads, threads implementation.
- Parallel programming, synchronization, synchronization basics, mutual exclusion using memory read&write.
- Synchronization using special instructions on uni-processor and multiprocessor systems with shared memory, priority inversion and solution.
- Synchronization tools and programming languages frameworks, classical synchronization tasks and their solutions.
- Processor scheduling, strategy, implementation, scheduling algorithms for uni-processor systems.
- Resource allocation, deadlock, deadlock avoidance, solutions for CR and SR systems.
- Memory architecture, paging, page tables and TLB.
- Virtual memory, paging algorithm, page replacement algorithms.
- Practical aspects of virtual memory - code sharing, memory sharing, locking, dynamic libraries, file mapping, kernel memory.
- Input and output, drivers, synchronous and asynchronous operations, disk I/O optimization.
- Files systems, organization, space allocation, free space allocation, failure recovery, Unix file systems, BSD FFS and log based file systems.
- Security and protection, system access, data protection, security risks.