Title:

Advanced Operating Systems

Code:POS
Ac.Year:2009/2010
Term:Summer
Curriculums:
ProgrammeBranchYearDuty
IT-MSC-2MBI1stCompulsory-Elective - group O
IT-MSC-2MBS-Compulsory-Elective - group S
IT-MSC-2MGM2ndElective
IT-MSC-2MGM.2ndElective
IT-MSC-2MIN-Elective
IT-MSC-2MIN.-Elective
IT-MSC-2MIS1stCompulsory
IT-MSC-2MIS.1stCompulsory
IT-MSC-2MMI1stCompulsory-Elective - group O
IT-MSC-2MMM-Elective
IT-MSC-2MPS-Elective
IT-MSC-2MPV-Elective
IT-MSC-2MSK1stCompulsory-Elective - group B
IT-MSC-2EITE1stCompulsory
Language:Czech
Private info:http://www.fit.vutbr.cz/study/courses/POS/private/
Credits:5
Completion:examination (written)
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:3900013
 ExaminationTestsExercisesLaboratoriesOther
Points:65150020
Guarantee:Lampa Petr, Ing., CC
Lecturer:Lampa Petr, Ing., CC
Instructor:Kašpárek Tomáš, Ing., CC
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Prerequisites: 
Hardware/Software Codesign (HSC), DCSY
Follow-ups:
Real-Time Operating Sytems (ROS), DCSY
 
Learning objectives:
The goal is to acquaint students with the principles and concepts that are used as a basis of modern operating system kernels.
Description:
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 uniprocessor 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.
Knowledge and skills required for the course:
C language programming in Unix environment, computer architecture, Intel x86 assembler, basic principles of operating systems.
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.
Generic learning outcomes and competences:
A deeper understanding of computer systems and system programming.
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 uniprocessor 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 uniprocessor 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:
  1. Fork and synchronization.
  2. Message passing in Unix.
  3. Signals and signal handling.
Fundamental literature:
  1. Andrews, G.R.: Foundations of Multithreaded, Parallel, and Distributed Programming, Addison-Wesley, 2000, ISBN 0-201-35752-6
  2. Bic, L., Shaw, A.C.: Operating Systems Principles, Prentice-Hall, 2003, ISBN 0-13-026611-6
  3. Nutt, G.J.: Operating Systems: A Modern Perspective, Addison-Wesley, 2000, ISBN 0-201-61251-8
  4. Vahalia, U.: Unix Internals: The New Frontiers, Prentice-Hall, 1996, ISBN 0-13-101908-2
  5. Schimmel, K.: UNIX Systems for Modern Architectures: Symmetric Multiprocessing and Caching for Kernel Programmers, Addison-Wesley, 1994, ISBN 0-201-63338-8
  6. McKusick, M.K., Neville-Neil, G.V.: The Design and Implementation of the FreeBSD Operating System, Addison-Wesley, 2004, ISBN 0-201-70245-2
Study literature:
  1. Bic, L., Shaw, A.C.: Operating Systems Principles, Prentice-Hall, 2003, ISBN 0-13-026611-6
  2. Open Sources: Voices from the Open Source Revolution, O'Reilly, 1999, ISBN 1-56592-582-3
  3. Love, R.: Linux Kernel Development, Second Edition, Pearson Education, 2005, ISBN 0-672-32720-1
Controlled instruction:
The knowledge of students is examined by the projects and by the final exam. The minimal number of points which can be obtained from the final exam is 20. Otherwise, no points will be assigned to a student.
Progress assessment:
Written mid-term exam (max. 15 points) and submitted projects in due date. Projects have to be submitted before the deadline, late project submission will be graded 0 points.