Course details

Operating Systems 2

OS2 Acad. year 2005/2006 Summer semester 6 credits

Current academic year

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.

Guarantor

Language of instruction

Czech

Completion

Examination

Time span

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

Department

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 systems kernels.

Prerequisite knowledge and skills

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

Study literature

Fundamental literature

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 of computer exercises

  1. Unix programming environment - gcc, ld, gdb, make.
  2. Parallel system verification - spin and PROMELA.
  3. Running processes, process state, job control.
  4. Inter process communication in Unix - shared memory, message queue, semaphores.

Progress assessment

Study evaluation is based on marks obtained for specified items. Minimimum number of marks to pass is 50.

Controlled instruction

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

Back to top