CENG 328 Operating Systems
Spring 2005

Most recent announcement: Jun17

Announcements

Watch this space for the latest updates. Last updated 17.Haziran.2005 14:50 Grade distribution is given.

June 16, 2005 15:31 Evaluation of the final exam is completed. Grades are published on the announcement board. Lab grades are available.

June 14, 2005 11:01 Final exam solutions is available.

June 13, 2005 12:12 Make-up exam date is June 14, 2005 at 14.00. The list is given (that I have doctor's written excuse).

Midterm:

Yaren Ilgaz

Arzu Fatoş Köseoğlu

B. Alper Sinanoğlu

M Burak Uytun

Final:

No any excuse I received.

May 17, 2005 16:08 I will not be available between May 18 and Jun 3. Do not hesitate to contact via email.

May 9, 2005 14:12 The grades for the quiz5 -8 are published, see Course Schedule section.

May 9, 2005 14:02 The lecture notes for the thirteenth week is published , see Course Schedule section.

May 4, 2005 13:01 Midterm exam solutions is available.

May 2, 2005 17:36 Final Exam time is changed as Jun 10, 2005 10.40-12.30.

May 2, 2005 12:55 The lecture notes for the twelveth week is published , see Course Schedule section.

April 25, 2005 13:46 The lecture notes for the eleventh week is published , see Course Schedule section.

April 18, 2005 15:47 The lecture notes for the tenth week is published , see Course Schedule section.

April 11, 2005 16:22 The lecture notes for the nineth week is published , see Course Schedule section. The grades for the quiz4 is also published.

March 28, 2005 16:02 The lecture notes for the seventh week is published , see Course Schedule section.

March 24, 2005 17:49 Necessary information for compiling your modified java codes in Sun Lab is given. The results for the lab quizes are given, see Course Schedule section.

March 22, 2005 14:59 The grades for the quiz1, quiz2, quiz3 are published, see Course Schedule section.

March 21, 2005 15:29 The lecture notes for the sixth week is published , see Course Schedule section.

March 17, 2005 18:02 The midterm exam date is changed again , see Course Schedule section.

March 14, 2005 16:02 The midterm exam date is changed, see Course Schedule section.

March 14, 2005 15:49 The lecture notes for the fifth week is published , see Course Schedule section.

March 9, 2005 12:55 Necessary information for compiling your modified java codes in Sun Lab is given.

March 7, 2005 00:19 The lecture notes for the fourth week is published , see Course Schedule section.

March 2, 2005 15:59 Lab studies are modified, see Course Schedule section.

February 28, 2005 14:52 The lecture notes for the third week is published , see Course Schedule section. The codes presented in the class is available.

:21.Şubat.2005 15:44 The lecture notes for the second week is published , see Course Schedule section.

February 14, 2005 18:32:22 Lecture hours are changed, see the time table. Midterm and Final exam dates are announced, see Course Schedule section.

February 13, 2005 19:57 In the first lecture, there will be first metting.

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

• The tutorial links active.

• For laboratory studies, see Course Schedule section. (Modern Operating Systems Simulators) is a collection of Java-based simulation programs which illustrate key concepts presented in the text Andrew S. Tanenbaum,   Modern Operating System, Second Edition (Prentice-Hall, 2001). The software is designed for students and instructors using this text.

• Anyone wants to get turkix-3.0.iso or KNOPPIX_V3.7-2004-12-08-EN.iso or may ask to me.

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 java or C codes will be executed to study the operating system features and you will be responsible for writing codes, to be graded.

In the beginning of the each lecture hour, you will have a quiz (15 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.

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

• 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. 1.8)

    • Protection

  • 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

    • Process States

  • Threads

    • The Thread Model (see Fig. 2.9)

    • 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

    • Semaphores

    • Monitors

  • Classical IPC Problems

    • The Dining Philosophers Problem (see Fig. 2.17)

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

    • The Sleeping Barber Problem (see Fig. 2.20)

  • Scheduling

    • Introduction to Scheduling

    • Scheduling in Batch Systems

    • Scheduling in Interactive Systems

• Deadlock

  • Resources

  • Introduction to Deadlocks

    • Conditions for Deadlock (See Fig. 3.1)

    • Deadlock Modeling (See Fig. 3.2)

  • Deadlock Detection and Recovery

  • Deadlock Avoidance

    • Resource Trajectories (See Fig. 3.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. 4.3)

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

    • Relocation and Protection (see the Fig. 4.5)

  • Swapping

    • Memory Management cont.

  • Virtual Memory

    • Paging (see the Fig. 4.8)

    • Page Tables (see Fig. 4.12)

    • Inverted Page Tables

    • Basic policies

    • Page Replacement Algorithms

    • Page Replacement Cont.

  • Segmentation

    • Segmentation with Paging

    • Segmentation with Paging: MULTICS

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

• INPUT/OUTPUT

  • Principles of I/O Hardware

    • Device Controllers (see Fig. 5.1)

    • I/O Devices

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

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

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

    • Direct Memory Access (DMA)

  • Principles of I/O Software

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

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

    • Direct Memory Access (see Fig. 5.6c)

  • Operating System Design Issues

  • I/O Software Layers

    • Interrupt Handlers

    • Device Drivers (see Fig. 5.8)

    • Device Independent I/O Software

    • User Level Software

  • Disks (see Fig. 5.12)

    • Disk Hardware

    • Disk Formatting

    • Disk Arm Scheduling Algorithms (see Fig. 5.17)

    • Error-Handling

• File Systems

  • Files

    • File Naming

    • File Structure; From OS's perspective

    • File Types

    • File Access

    • File Attributes(see Fig. 6.4)

    • File Operations

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

    • Memory-Mapped Files (see Fig. 6.7)

    • File Organization and Access; Programmer's Perspective

  • Directories

    • Path Names

    • File Sharing

  • File System Implementation

    • File System Layout

    • Implementing Files (see Fig. 6.12)

    • Implementing Directories

    • Shared Files (see Fig. 6.16)

    • Disk Space Management (Free space management)

    • Other file system implementation issues

  • 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.

Some useful C++ links can be found here and here.

Notes on Java. The following references are available online at the Java home site.

• The Java Tutorial

• The Java Language Specification

• Code Conventions for the Java Programming Language

• Java API Documentation

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.