Faculty of Information Technology, BUT

Course details

Operating Systems 2

OS2 Acad. year 2004/2005 Summer semester 6 credits

Basic concepts, operating system kernel, kernel structure. Parallel programming and synchronization withe a view to kernel synchronization. Deadlock, deadlock detection and prevention. Scheduling algorithms for uniprocessor systems. Memory management, virtual memory, paging, virtual memory implementation. Input/Output, synchronous and asynchronous I/O, drivers, optimalization of disk operations, File systems, disk space allocation, metadata structures, failure recovery, file system examples. Security and protection.


Lampa Petr, Ing. (CC FIT BUT)

Language of instruction



Examination (written)

Time span

39 hrs lectures, 8 hrs pc labs, 18 hrs projects

Assessment points

56 exam, 20 half-term test, 24 projects



Lampa Petr, Ing. (CC FIT BUT)


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.

Learning objectives

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


Study literature

Fundamental literature

  • Andrews, G.R.: Foundations of Multithreaded, Parallel, and Distributed Programming, Addison-Wesley, 2000, ISBN 0-201-35752-6
  • 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., Bostic, K., Karels, M.,J., Quaterman, J.S.: The Design and Implementation of the 4.4BSD Operating System, Addison-Wesley, 1996, ISBN 0-201-54979-4

Syllabus of lectures

  1. Kernel structure, interface, system calls, context switch, interrupts,
  2. System interface, Unix systems interface, standardization, SVID, XPG,
  3. Paralel programming, synchronization, synchronization mechanisms,
  4. Scheduling, strategy, implementation, batch, real-time, time sharing
  5. Processes and threads, POSIX threads, synchronization, signals, process
  6. Files systems, organization, space allocation, free space allocation,
  7. Virtual memory, TLB, cache, page tables, examples (ix86, MIPS, 680x0),
  8. Input and output, drivers, synchronous and asynchronous operations, Unix
  9. Programming environment, libraries, dynamic libraries, binary formats,
  10. Security and protection, system access, data protection.

Syllabus - others, projects and individual work of students

  1. Verification of parallel algorithm using spin.
  2. Fork and sychronization.
  3. Message passing in Unix.
  4. Signals and signal handling.

Progress assessment

Written mid-term exam (20 points) and submitted project in due date.
Back to top