CENG 328 Operating Systems
Spring 2006

Most recent announcement: June 13

Announcements

Watch this space for the latest updates. Last updated: 13.Haziran.2006 16:38 Grade distribution is given.

10.Haziran.2006 17:13 Evaluation of the final exam is completed. Grades are published on the announcement board.

2.Haziran.2006 14:02 Make-up exam date is June 09, 2006 at 14.00. The list is given (that I have doctor's written excuse).

Midterm:

Ömer Çelik

Özgür Pekçağlıyan

Serhat Karataş

Sevil Arslan

Şule Alpun

Volkan Ebil

Yusuf Mertkan Koyuncu

Yusuf Soyman

Final:

?

22.Mayıs.2006 14:50 The grades for the last quiz are published, see Course Schedule section, all the grades are published also on the announcement board. The worst of the quizes will also be discarded.

Aşağıda ismi olan öğrencilerin benimle görüşmeleri gerekmektedir.

17.Mayıs.2006 17:04 The grades for the lab. studies are published, see Course Schedule section. (worst of the labs was discarded)

15.Mayıs.2006 14:01 Evaluation of the midterm exam is completed. Grades are published on the announcement board. The lecture notes for the fourteenth week is published , see Course Schedule section.

8.Mayıs.2006 12:35 The lecture notes and also lab notes for the thirteenth week are published , see Course Schedule section.

1.Mayıs.2006 12:08 The lecture notes and also lab notes for the twelfth week are published , see Course Schedule section.

27.Nisan.2006 17:56 Final exam date is announced , see Course Schedule section.

24.Nisan.2006 12:22 The lecture notes and also lab notes for the eleventh week are published , see Course Schedule section.

17.Nisan.2006 11:32 The lecture notes and also lab notes for the tenth week are published , see Course Schedule section.

10.Nisan.2006 14:45 The grades for the lab. studies are published, see Course Schedule section.

10.Nisan.2006 12:07 The lecture notes and also lab notes for the nineth week are published , see Course Schedule section.

3.Nisan.2006 14:01 The grades for the quizes are published, see Course Schedule section.

27.Mart.2006 11:09 The lecture notes and also lab notes for the seventh week are published , see Course Schedule section.

21.Mart.2006 10:47 The third assignment is added to pdf.

20.Mart.2006 10:31 The lecture notes and also lab notes for the sixth week are published , see Course Schedule section.

13.Mart.2006 16:10 The midterm exam date is announced, see Course Schedule section.

13.Mart.2006 10:43 The lecture notes and also lab notes for the fifth week are published , see Course Schedule section.

7.Mart.2006 19:09 The second assignment is added to pdf.

6.Mart.2006 13:35 The lab notes for the fourth week is published , see Course Schedule section.

5.Mart.2006 16:48 The lecture notes for the fourth week is published , see Course Schedule section.

27.Şubat.2006 11:32 The lecture notes for the third week is published , see Course Schedule section. Also the lab notes is available.

19.Şubat.2006 18:03 The lecture notes for the second week is published , see Course Schedule section. Also the lab notes and first assignment is available, you will be graded in the second hour of the next week's lab.

18.Şubat.2006 15:45 In the first lecture, there will be first metting. Fourth Lab groub is closed. If you registered to this section, you should attend any of the other three lab groups, see the time table.

• The lecture notes for the second week will be published soon, see Course Schedule section.

• The tutorial links active.

• For laboratory studies, our policy is changed as we will not study MOSS instead we will study C codes and students will be encouraged to programming for concepts presented in the class. There will be assignments to be graded in the following laboratory session.

• Anyone wants to get turkix*iso or KNOPPIX_V*.iso or may ask to room 308.

Overview

Ceng 328 is intended as a general introduction to the techniques used to implement operating systems and related kinds of systems software. Among the topics covered will be;

• basic operating system structure

• process and thread synchronization

• process scheduling and resource management

• process management (creation, synchronization, and communication);

• deadlock prevention, avoidance, and recovery;

• memory management techniques, main-memory management, virtual memory management

• control of disks and other input/output devices;

• file-system structure.

This course assumes familiarity with basic computer organization (e.g., processors, memory, and I/O devices). You will need to be able to program in Java / C (or C++) to perform the assignments in the course.

Lecture Information

There are two groups for lecturing and three groups for lab sessions, you may attend any one of the lecture hours but not for lab sessions. Please attend your predefined lab sessions regularly. The UNIX operating system will be introduced to you first in the lab sessions , later some C codes will be executed to study the operating system features and you will be responsible for writing codes, to be graded.

You MAY have a quiz (10 minutes) for the previos week's subjects. There won't be any make-up for these quizes and they will have weight for the final grading. We do not have a regular quiz policy, we may have a quiz or not in the lecture hours.

Important announcements will be posted to the Announcements section of this web page above, so please check this page frequently. You are responsible for all such announcements, as well as announcements made in lecture.

Course Outline

• Contents

• List of Tables

• List of Figures

• OPERATING SYSTEMS LABORATORY I - UNIX Tutorial

  • Operating System

    • The Kernel

    • The Shell

    • UNIX file system

  • History of the UNIX operating system

    • Modern variants of UNIX

  • Logging In and Logging Out

    • Logging in

    • Logging Out

  • Commands

    • Simple Commands; date, whoami, echo

    • Files

    • Directories

  • Compiling A C/C++ Program

    • Running The Resulting Program

    • Creating Debug-Ready Code

    • Creating Optimized Code

    • Getting Extra Compiler Warnings

    • Compiling A Single-Source "C++" Program

    • Compiling A Multi-Source C Program

    • Getting a Deeper Understanding - Compilation Steps

  • Debugging C/C++ Programs Using gdb

    • Invoking the "gdb" Debugger

    • Running A Program Inside The Debugger

    • Setting Breakpoints

    • Stepping A Command At A Time

    • Printing Variables And Expressions

    • Examining The Function Call Stack

    • Attaching To an Already Running Process

    • Debugging A Crashed Program

  • Exercises

• Introduction

  • What is Operating System?

    • Functionalities in OS:

  • History of operating Systems

    • Mainframe Systems

    • Batch and Multiprogrammed Systems

    • Time Sharing

    • Personnel Computers

    • Parallel Processing Systems

    • Distributed Systems

    • Real-Time

    • Embedded, Smart-Card and Handheld

  • Computer Hardware Review

    • Processor

    • Main Memory

    • I/O Modules and Structure

    • System bus

    • Storage Structure and Hierarchy (See Fig. 2.8)

    • Protection

  • OPERATING SYSTEMS LABORATORY II - C Review

  • Interrupts and Traps

  • Operating System Components

  • Bootstrapping

  • System Structure

  • Problems in building OS

• Processes and Threads

  • Processes

    • The Process Model

    • Context Switch

    • Dispatcher

    • Process Creation

    • Process Termination

  • OPERATING SYSTEMS LABORATORY III - Processes I

    • Process States

  • Threads

    • The Thread Model (see Fig. 3.10)

    • Implementing Threads in User Space

    • Implementing Threads in the Kernel

  • Interprocess Communication

    • Race Conditions

    • Critical Regions

    • Mutual Exclusion with Busy Waiting (Software approach)

    • Sleep and wakeup

  • OPERATING SYSTEMS LABORATORY IV - Processes II& Threads I

    • Semaphores

    • Monitors

  • Classical IPC Problems

    • The Dining Philosophers Problem (see Fig. 3.18)

    • The Readers and Writers Problem (see Fig. 3.20)

    • The Sleeping Barber Problem (see Fig. 3.21)

  • Scheduling

    • Introduction to Scheduling

    • Scheduling in Batch Systems

  • OPERATING SYSTEMS LABORATORY V - Synchronization and Critical Section

    • Examples&Exercises:

    • Scheduling in Interactive Systems

• Deadlock

  • Resources

  • Introduction to Deadlocks

    • Conditions for Deadlock (See Fig. 4.1)

    • Deadlock Modeling (See Fig. 4.2)

  • Deadlock Detection and Recovery

  • OPERATING SYSTEMS LABORATORY VI - InterProcessCommunications I

    • Examples&Exercises:

    • Assignment:

  • Deadlock Avoidance

    • Resource Trajectories (See Fig. 4.4)

    • Safe and Unsafe States

    • The Banker's Algorithm for Deadlock Avoidance

  • Deadlock Prevention

  • Summary of Deadlock strategies

• Memory Management

  • Basic Memory Management

    • Monoprogramming without Swapping or Paging (see the Fig. 5.3)

    • Multiprogramming with Fixed Partitions (see the Fig. 5.4)

    • Relocation and Protection (see the Fig. 5.5)

  • Swapping

  • OPERATING SYSTEMS LABORATORY VII - InterProcessCommunications II

    • Examples&Exercises:

    • Memory Management cont.

  • Virtual Memory

    • Paging (see the Fig. 5.8)

    • Page Tables (see Fig. 5.12)

    • Inverted Page Tables

    • Basic policies

    • Page Replacement Algorithms

    • Page Replacement Cont.

  • OPERATING SYSTEMS LABORATORY VIII - Scheduling

    • Exercise:

    • Assignment:

  • Segmentation

    • Segmentation with Paging

    • Segmentation with Paging: MULTICS

    • Segmentation with Paging: The Intel Pentium (see Fig. 5.18)

• INPUT/OUTPUT

  • Principles of I/O Hardware

    • Device Controllers (see Fig. 6.1)

    • I/O Devices

    • Characteristics (see Table 6.2) and Differences in I/O Devices

    • Evolution of the I/O Function (see Fig. 6.2)

    • Memory-Mapped I/O (see Fig. 6.3)

    • Direct Memory Access (DMA)

  • Principles of I/O Software

    • Programmed I/O (see Fig. 6.6a)

    • Interrupt-Driven I/O (see Fig. 6.6b)

    • Direct Memory Access (see Fig. 6.6c)

  • OPERATING SYSTEMS LABORATORY IX - Memory Management I

    • Examples&Exercises:

  • Operating System Design Issues

  • I/O Software Layers

    • Interrupt Handlers

    • Device Drivers (see Fig. 6.8)

    • Device Independent I/O Software

    • User Level Software

  • Disks (see Fig. 6.12)

    • Disk Hardware

    • Disk Formatting

    • Disk Arm Scheduling Algorithms (see Fig. 6.17)

    • Error-Handling

  • OPERATING SYSTEMS LABORATORY X - Memory Management II

    • Examples&Exercises:

    • Assignment:

• File Systems

  • Files

    • File Naming

    • File Structure; From OS's perspective

    • File Types

    • File Access

    • File Attributes(see Fig. 7.4)

    • File Operations

    • An Example Program Using File System Calls (see Fig. 7.6)

    • Memory-Mapped Files (see Fig. 7.7)

    • File Organization and Access; Programmer's Perspective

  • Directories

    • Path Names

    • File Sharing

  • OPERATING SYSTEMS LABORATORY XI - I/O Efficiency

    • Examples&Exercises:

• File System Implementation

  • File System Layout

  • Implementing Files (see Fig. 7.12)

  • Implementing Directories

  • Shared Files (see Fig. 7.16)

  • Disk Space Management (Free space management)

  • Other file system implementation issues

• OPERATING SYSTEMS LABORATORY XII - Files and Directories

  • Examples&Exercises:

• UNIX File Management

• References:

• vita

• About this document ...

Text Book

Required

Readings will be assigned in Modern Operating Systems, Second Edition by Andrew S. Tanenbaum, Prentice Hall, 2001.

Recommended

Another recently used text book that covers the same material is Operating System Concepts, 7th Edition by Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, John Wiley and Sons, January 2005.

This text is only recommended rather than required. This book is useful for reference, for an alternative point of view.

Online References

Some materials are given. Please inform me about the usefullness of the materials. Check this place for updates.

Grading Criteria

• There will be a midterm and a final exam, will count 20% and 40% of your grade, respectively.

• Quiz: 15% (worst of the quizes will be discarded)

• Lab: 15% (worst of the labs will be discarded)

• Attendance is required and constitutes part of your course grade; 10%

Policies

• Attendance is not compulsory, but you are responsible for everything said in class.

• I encourage you to ask questions in class. You are supposed to ask questions. Don't guess, ask a question!

• You may discuss homework problems with classmates (although it is not to your advantage to do so).

• You can use ideas from the literature (with proper citation).

• You can use anything from the textbook/notes.

• The code you submit must be written completely by you.

Course Schedule

The following schedule is tentative; it may be updated later in the semester, so check back here frequently.