CENG 328 Operating Systems
Spring 2004

Most recent announcement: Jun20

Announcements

Watch this space for the latest updates. Last updated: 20.Haziran.2004 17:25 The distribution of the grades are given.

June 16, 2004 12:38The grading of the final is completed.

June 9, 2004 10:48 Lab and Quiz9 grades are available, see Course Schedule section. Final exam grades will be published at June 15, 2004.

June 1, 2004 14:46 The make-up exam date is June 14, 2004 14.00. Exam covers the all course subjects , be sure about the valid healt reports and check if I have received. The MOSS projects will be evaluated by the instructor and the file system project by the teaching assistant. Better presentation and defense will be benefit of you.

May 28, 2004 13:52 The writing error in the fifth question of recitation is corrected, see Course Schedule section.

May 27, 2004 12:38 The recitation is available, see Course Schedule section. The lab quiz4 and solution is avaiable. The lab projects are due to Jun 16, 2004. You are supposed to study three projects, choose any 2 of 4 MOSS projects and 1 file systems project. All the projects will be graded as bonus points at total %15. Team-work is allowed, but

• not more than 4 students

• suppose to declare the names of the students in the group to us until Jun 15, 2004

• the grade of the group will be the worst student's grade

May 26, 2004 14:28 The lecture notes as two-pages-in-one file is available.

May 25, 2004 12:38The lecture notes for the fifteenth week is published, see Course Schedule section. The lecture notes as a one file is available.

May 24, 2004 16:07 The grading of the first midterm is completed. The lecture notes as a one file is available.

May 23, 2004 13:43 Quiz7, Quiz8 and grades are available, see Course Schedule section.

May 22, 2004 20:43 The lecture notes for the thirteenth week is published, see Course Schedule section.

May 21, 2004 14:59 Ceng 328 Lab Quiz 4 will be done on 26.05.2004 Wednesday 19.00 o'clock in B-301 and B-309.

May 20, 2004 20:05 Ceng 328 Lab Quiz 4 will be done on 26.05.2004 Wednesday 18.00 o'clock in B-301 and B-309.

May 18, 2004 13:24 19.05.2004 Çarşamba günü olan CENG 328 dersinin 3. ve 4. gruplarının lab çalışmaları 20.05.2004 Persembe günü saat 17.00-19.00 arasında yapılacaktır. Bu gruplarda bulunan ögrenciler isterlerse 18.05.2004 Salı günü saat 17.00-19.00 arasında yapılan grup5 lab çalışmasına da katılabilirler.

May 16, 2004 18:43 The lecture notes for the twelveth week is published, see Course Schedule section.

May 12, 2004 12:35 The project work is given (html, pdf). The solutions for the third lab quiz is available (doc, pdf).

May 9, 2004 19:45 The solutions for the Midterm Exam is given. The lecture notes for the eleventh week is published, see Course Schedule section.

May 6, 2004 14:44 Quiz5, Quiz6 and grades are available, see Course Schedule section. The lab work for the eleventh week is available. Do it yourself at home and be prepared to be asked at the lab hour. The related work given as project will be bonus and due to the end of the semester.

May 2, 2004 15:14 The lecture notes for the eleventh week is published, see Course Schedule section.

30.Nisan.2004 14:45 Quiz4 and grades are available, see Course Schedule section.

25. April 2004 The lecture notes for the tenth week is published, see Course Schedule section.

20. April 2004 The lab work for the nineth week is available. Do it yourself at home and be prepared to be asked at the lab hour. The related work given as project will be bonus and due to the end of the semester. Anyone wants to get KNOPPIX_V3.3-2004-02-16-EN.iso may ask to me.

April 18, 2004 The lecture notes for the nineth week is published, see Course Schedule section. In this week's lab, grading of lab7 will also be completed. The lab grades are available.

April 5, 2004 Necessary information for compiling your modified java codes in Sun Lab is given. Anyone can ask to the technician for studying in the Sun Lab during Free Hours including weekends. For any problems about Free Hours in Sun Lab please inform me.

4. April 2004 Quiz3 and grades are available, see Course Schedule section. The lab work for the forth week is available.

3. April 2004 The lecture notes for the seventh week is published, see Course Schedule section. The corrected form of Lab7 is available.

1. April 2004 The lab work for the seventh week is available. Do it yourself at home and be prepared to be asked at the lab hour. The related work given as project will be bonus and due to the end of the semester.

27.Mart 2004 NO LECTURE in this week. Sorry!. There will be labs as usual.

21. March 2004 The lecture notes for the fifth week is published, see Course Schedule section. The code examples in C language for the first four labs are available, you are advised to study these codes for better understanding and exam purposes. Extract with the command “tar -zxvf lab1-4.tgz” in Unix then compile with the command “gcc -o dosya dosya.c”. For the codes including threads, compilation is as the following: “gcc -o dosya -lpthread dosya.c”. For problems, see me at the office hours.

18. March 2004 Quiz2 and grades are available, see Course Schedule section. Lecture places are changed as Monday B401 and Tuesday B308.

17. March 2004 199711297 Ali YAPRAK, 199932072 İhsan Tolga MEDENI, see Cem Özdoğan urgently for Ceng328 Operating Systems, Subjet: Registration

14. March 2004 The lecture notes for the fourth week is published. The pdf formats for the first three labs are available, see Course Schedule section.

12. March 2004 Lab groups are defined. See the list. For any objections, visit me at the office hours. Any one insisting to attend the unlisted lab session will not be allowed.

10. March 2004 Quiz1 and grades are available, see Course Schedule section.

March 6, 2004 The lecture notes for the third week is published, see Course Schedule section.

March 4, 2004 For laboratory studies, see Course Schedule section. Modern Operating Systems Simulators

moss (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.

1. March 2004 Midterm Exam Date is published, see Course Schedule section. The third-lecture-notes is available partially!. The tutorial link tutorial link is active.

February 21, 2004 In the first lecture, there will be first metting. The lecture notes for the second week is published, see Course Schedule section.

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

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

    • Protection

  • Interrupts and Traps

    • Accessing OS Services

  • Operating System Components

  • Bootstrapping

  • System Structure

  • Why Study Operating Systems?

    • Problems in building OS

• Processes and Threads

  • Processes

    • The Process Model

    • Context Switch

    • Dispatcher

    • Process Creation

    • Process Termination

    • Process States

  • Threads

    • The Thread Model

    • 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

  • Policy versus Mechanism

• Deadlock

  • Resources

  • Introduction to Deadlocks

    • Conditions for Deadlock (See Fig. 3.1)

    • Deadlock Modeling (See Fig. 3.2)

  • The Ostrich Algorithm

  • Deadlock Detection and Recovery

  • Deadlock Avoidance

    • Resource Trajectories (See Fig. 3.4)

    • Safe and Unsafe States (See Fig. 3.5)

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

    • Interrupts Revisited (see Fig. 5.6)

  • Principles of I/O Software

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

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

    • Direct Memory Access (see Fig. 5.7c)

  • Operating System Design Issues

  • I/O Software Layers (see Fig. 5.8)

    • Interrupt Handlers

    • Device Drivers (see Fig. 5.9)

    • Device Independent I/O Software(see Fig. 5.10)

    • User Level Software

  • Disks (see Fig. 5.13)

    • Disk Hardware

    • Disk Formatting

    • Disk Arm Scheduling Algorithms (see Fig. 5.18)

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

    • Implementing Directories

    • Shared Files (see Fig. 6.17)

    • Disk Space Management (Free space management)

    • Other file system implementation issues

  • UNIX File Management

  • 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 Applied Operating Systems Concepts, Sixth Edition by Abraham Silberschatz, Peter Galvin, and Greg Gagne, John Wiley and Sons, 2003.

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%

Course Schedule

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