Course details

Advanced Operating Systems

POS Acad. year 2022/2023 Summer semester 5 credits

Current academic year

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.

Guarantor

Language of instruction

Czech

Completion

Examination (written)

Time span

  • 39 hrs lectures
  • 13 hrs projects

Assessment points

  • 60 pts final exam (written part)
  • 10 pts projects

Department

Lecturer

Instructor

Subject specific learning outcomes and competences

Students are acquainted with the parallel programming using POSIX threads, usage of synchronization primitives, virtual memory and file system.

A deeper understanding of computer systems and system programming.

Learning objectives

The goal is to acquaint students with the principles and concepts that are used as a basis of modern operating system kernels.

Recommended prerequisites

Prerequisite knowledge and skills

C language programming in Unix environment, computer architecture, Intel x86 assembler, basic principles of operating systems.

Study literature

  • Andrews, G.R.: Foundations of Multithreaded, Parallel, and Distributed Programming, Addison-Wesley, 2000, ISBN 0-201-35752-6
  • Stevens, W.,R.: Advanced Programming in the UNIX Environment: Third Edition, Addison-Wesley Professional, 2013, ISBN 0-321-63773-9
  • Nutt, G.J.: Operating Systems: A Modern Perspective, Addison-Wesley, 2000, ISBN 0-201-61251-8
  • Vahalia, U.: Unix Internals: The New Frontiers, Prentice-Hall, 1996, ISBN 0-13-101908-2
  • Schimmel, K.: UNIX Systems for Modern Architectures: Symmetric Multiprocessing and Caching for Kernel Programmers, Addison-Wesley, 1994, ISBN 0-201-63338-8
  • McKusick, M.K., Neville-Neil, G.V.: The Design and Implementation of the FreeBSD Operating System, Addison-Wesley, 2004, ISBN 0-201-70245-2

Syllabus of lectures

  1. Kernel structure, interface, system calls, context switch, interrupts, system interface, Unix systems interface, standardization, SVID, XPG.
  2. Processes and POSIX threads, creating processes and threads, threads implementation.
  3. Parallel programming, synchronization, synchronization basics, mutual exclusion using memory read&write.
  4. Synchronization using special instructions on uni-processor and multiprocessor systems with shared memory, priority inversion and solution.
  5. Synchronization tools and programming languages frameworks, classical synchronization tasks and their solutions.
  6. Processor scheduling, strategy, implementation, scheduling algorithms for uni-processor systems.
  7. Resource allocation, deadlock, deadlock avoidance, solutions for CR and SR systems.
  8. Memory architecture, paging, page tables and TLB.
  9. Virtual memory, paging algorithm, page replacement algorithms.
  10. Practical aspects of virtual memory - code sharing, memory sharing, locking, dynamic libraries, file mapping, kernel memory.
  11. Input and output, drivers, synchronous and asynchronous operations, disk I/O optimization.
  12. Files systems, organization, space allocation, free space allocation, failure recovery, Unix file systems, BSD FFS and log based file systems.
  13. Security and protection, system access, data protection, security risks.

Syllabus - others, projects and individual work of students

Independently assigned project in the range of 13 hours, evaluated 10 points on the topics discussed in lectures.

Progress assessment

During the semester online tests and project. The project must be submitted by the published date, late submission of the project is evaluated 0 points.

Controlled instruction

Students' knowledge is verified by project elaboration, online tests and a final exam.

Course inclusion in study plans

Back to top