Next: Semantics of Programming Languages
Up: Lent Term 2004: Part
Previous: Introduction to Security
  Contents
Operating Systems II
Lecturer: Dr S.M. Hand
No. of lectures: 8
Prerequisite courses: Operating Systems I, Concurrent Systems and Applications
This course is a prerequisite for Advanced Systems Topics (Part II),
Distributed Systems (Part II).
Aims
This course hopes to impart a detailed understanding of the algorithms
and techniques used within operating systems. It aims to consolidate
and build upon the knowledge learnt in earlier courses, and to
encourage students to develop an appreciation for the trade-offs
involved in designing and implementing an operating system.
Lectures
- Thread scheduling.
Recap: OS functions & structures. Thread
package architectures (user, kernel, combined).
Scheduling for multiprocessors. [1 lecture]
- Real-time systems.
Introduction. Real-time scheduling:
static versus dynamic algorithms. Examples (RM, EDF, etc.).
Priority inversion. SRT/multimedia scheduling. [1 lecture]
- Virtual memory management.
Logical versus physical addresses. Address binding. Single
and multi-VAS models. Review: segmented/paged memory.
Translation schemes. Demand paging/segmentation. Replacement
strategies: OPT, FIFO, LRU (and approximations), NRU, LFU/MFU, MRU.
Working set schemes. Application hooks. Prepaging and page daemons.
Case studies. [2 lectures]
- Storage systems.
Basic I/O revisited. Disks I/O.
Disk scheduling: FCFS, SSTF, SCAN, C-SCAN, etc.
Logical volumes. RAID. Disk caching; motivation, Unix buffer cache,
NT cache manager. Filing systems: file mapping algorithms, metadata,
namespace. Directory implementation. Integrity management. Examples:
FAT, FFS/EXT2, NTFS, LFS. [3 lectures]
- Protection.
Requirements. Subjects and objects. Design principles. Authentication
schemes. Access matrix: ACLs and capabilities. Combined scheme.
Covert channels. [1 lecture]
Objectives
At the end of the course students should be able to
- write a simple program which implements any simple disk
scheduling algorithm
- define the ``working set'' of a process
- sketch the design of a log-structured file system
- describe the advantages/disadvantages of the
various page-replacement strategies
- understand the differences between ACLs and capabilities
Recommended books
* Bacon, J. & Harris, T. (2003). Operating systems (3rd ed.).
Addison-Wesley.
Silberschatz, A., Peterson, J.L. & Galvin, P.C. (1998). Operating systems concepts. Addison-Wesley (5th ed.).
Tanenbaum, A.S. (2001). Modern operating systems (2nd ed.).
Prentice-Hall.
Leffler, S. (1989). The design and implementation of the 4.3BSD Unix
operating system. Addison-Wesley.
Solomon, D. & Russinovich, M. (2000). Inside Windows 2000. Microsoft Press (3rd ed.).
Singhal, M. & Shivaratri, N. (1994). Advanced concepts in operating
systems: distributed, database, and multiprocessor operating
systems. McGraw-Hill.
Next: Semantics of Programming Languages
Up: Lent Term 2004: Part
Previous: Introduction to Security
  Contents
Christine Northeast
Thu Sep 4 15:29:01 BST 2003