CENG 328 Operating Systems
Summer 2009

Most recent announcement: Aug17

Announcements

Watch this space for the latest updates (If the characters do not show properly, please try viewing this page with Unicode (UTF-8) encoding). Last updated:

17.Ağustos.2009 17:00 Distribution of the grades is given.

17.Ağustos.2009 00:02 ONLY PAPER-SUBMITTED ASSIGNMENTS ARE EVALUATED. If you only submitted via E-mail, YOU HAVE TIME TO SUBMIT ON PAPER UNTIL NOON TIME (AUGUST 17, 2009).

16.Ağustos.2009 23:48 The evaluation of the laboratory assignments are completed, see Course Schedule section. We have a password protection mechanism (username: cankaya password: cankaya).

16.Ağustos.2009 23:47 The evaluation of final exam papers is completed. Your final exam grades are available, check your sql server.

13.Ağustos.2009 23:16 The last years'final exam questions are available, see the corresponding web page. Grading Criteria is updated, see the corresponding section. There will be a make-up exam at Friday afternoon ( to students with Doctor's written excuse). The submission of the assignments are possible (but not with full grading) until August 17 Monday noon. I will not accept afternoon.

11.Ağustos.2009 23:08 The lecture notes for the thirteenth week is available, see Course Schedule section. The questions for the midterm exam is also available.

6.Ağustos.2009 16:04 The lecture notes for the eleventh week is available, see Course Schedule section.

4.Ağustos.2009 22:25 The lecture notes for the tenth week is available, see Course Schedule section.

31.Temmuz.2009 00:41 The lecture notes for the nineth week is available, see Course Schedule section. Preliminary final exam date is announced.

27.Temmuz.2009 17:33 Midterm examination will be held on LAB HOUR (July 29, 2009 10:40)

24.Temmuz.2009 01:10 The lecture notes for the seventh week is available, see Course Schedule section. Laboratory Study Assignment III is due to Aug 07, 2009. You should submit your code, results via E-mail and also on paper. In each E-mail, please add the assignment number, your name and ID number to the subject line.

21.Temmuz.2009 22:56 The lecture notes for the sixth week is available, see Course Schedule section. Midterm examination date is July 29, 2009 and will be held on class hour and at lecture hall (A319). You will be responsible all sections including July 22 lecture.

16.Temmuz.2009 23:16 The lecture notes for the fifth week is available, see Course Schedule section. Laboratory Study Assignment II is due to July 31, 2009. You should submit your code, results via E-mail and also on paper.

14.Temmuz.2009 23:25 The lecture notes for the fourth week is available, see Course Schedule section.

9.Temmuz.2009 23:42 The lecture notes for the third week is available, see Course Schedule section. Laboratory Study Assignment I and Assignment I BONUS are due to July 24, 2009. You should submit your code, results via E-mail and also on paper.

6.Temmuz.2009 12:50 The lecture notes for the second week is available, see Course Schedule section. Texts for the week1 and additional lab. are modified.

3.Temmuz.2009 09:43 This web page is finally available.

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

• The tutorial link is active.

• For laboratory studies, 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 a live cd without installing linux, download from local server or may ask to room 308.

• Pardus

• KNOPPIX

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

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

• file-system structure

• control of disks and other input/output devices;

• deadlock prevention, avoidance, and recovery.

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 C ( or Java / C++) to perform the assignments in the course.

Lecture Information

There is one group for lecturing and lab sessions. Please attend your predefined lab sessions regularly. Your sits in the lab will not be changed there after. 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 have a pop-up quiz policy.

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 An Operating System?

  • The Operating System as an Extended Machine

  • The Operating System as a Resource Manager

  • Functionalities in OS:

  • History of Operating Systems

    • Mainframe Systems

    • Batch and Multiprogrammed Systems

    • Time Sharing

    • Personnel Computers

    • Parallel Processing Systems - Tightly coupled systems

    • Distributed Systems - Loosely coupled systems

    • Real-Time

    • Embedded, Smart-Card and Handheld

  • Computer Hardware Review

    • Processor

    • Memory

    • I/O Modules and Structure

    • System Bus

  • OPERATING SYSTEMS LABORATORY I - UNIX Tutorial

    • Login and Logout

    • Commands

      • Simple Commands

      • Files

      • Directories

    • Compiling A C Program

      • Running The Resulting Program

    • Compiling A Multi-Source C Program

    • Exercises

  • OPERATING SYSTEMS LABORATORY I - UNIX Tutorial - Additional

    • The Kernel

    • The Shell

    • UNIX file system

    • History of the UNIX operating system

      • Modern variants of UNIX

    • Debugging C/C++ Programs Using gdb

      • Creating Debug-Ready Code

      • Creating Optimized Code

      • Getting Extra Compiler Warnings

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

      • Getting a Deeper Understanding - Compilation Steps

      • 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

  • UNIX System initialization and Bootstrapping

  • The Operating System Zoo

  • Operating System Concepts

  • System Calls

  • Operating Systems Structure

    • Monolithic Systems

    • Layered Systems

    • Microkernels

    • Client-Server Model

    • Virtual Machines

    • Exokernels

  • Problems in building OS

  • OPERATING SYSTEMS LABORATORY II - C Review I

• Processes and Threads

  • Processes

    • The Process Model

    • Process Creation

    • Process Termination

    • Process States

    • Implementation of Processes

    • Context Switch

    • Dispatcher

    • Modelling Multiprogramming

  • Threads

    • The Thread Model

    • Thread Usage

    • Implementing Threads in User Space

    • Implementing Threads in the Kernel

  • OPERATING SYSTEMS LABORATORY III - C Review II

  • OPERATING SYSTEMS LABORATORY III - Additional Assignment for C Review

  • Interprocess Communication, IPC

    • Race Conditions

    • Critical Regions

    • Mutual Exclusion with Busy Waiting

    • Sleep and wakeup

    • Semaphores

    • Mutexes

    • Monitors

    • Barriers

  • OPERATING SYSTEMS LABORATORY IV - Processes I

  • Scheduling

    • Introduction to Scheduling

    • Scheduling in Batch Systems

    • Scheduling in Interactive Systems

    • Policy versus Mechanism

  • Classical IPC Problems

    • The Dining Philosophers Problem

    • The Readers and Writers Problem

  • OPERATING SYSTEMS LABORATORY V - Processes II& Threads I

    • Examples&Exercises:

    • Assignment II

  • OPERATING SYSTEMS LABORATORY V - Additional Thread Exercises:

• Memory Management

  • Basic Memory Management

    • Monoprogramming without Swapping or Paging

  • Memory Abstraction

    • Relocation and Protection

    • Swapping

    • Managing Free Memory

  • Virtual Memory

    • Paging

    • Page Tables

  • OPERATING SYSTEMS LABORATORY VI - Synchronization, Critical Section, InterProcessCommunications I

    • Examples:

  • OPERATING SYSTEMS LABORATORY VI Additional - Synchronization and Critical Section, InterProcessCommunications I

    • Examples&Exercises:

  • Page Replacement Algorithms

    • The Optimal Page Replacement Algorithm

    • The Not Recently Used Page Replacement Algorithm

    • The First-In, First-Out (FIFO) Page Replacement Algorithm

    • The Second Chance Page Replacement Algorithm

    • The Clock Page Replacement Algorithm

    • The Least Recently Used (LRU) Page Replacement Algorithm

    • The Working Set Page Replacement Algorithm

    • The WSClock Page Replacement Algorithm

    • Summary of Page Replacement Algorithms

  • Implementation Issues

    • Page Fault Handling

    • Separation of Policy and Mechanism

  • Segmentation

  • OPERATING SYSTEMS LABORATORY VII - Scheduling

    • MOSS Simulator

    • Assignment III

  • OPERATING SYSTEMS LABORATORY VII Additional - InterProcessCommunications II

    • Examples&Exercises:

• File Systems

  • Files

    • File Naming

    • File Structure

    • File Types

    • File Access

    • File Attributes

    • File Operations

    • An Example Program Using File System Calls

    • Memory-Mapped Files

  • Directories

  • File System Implementation

    • File System Layout

  • OPERATING SYSTEMS LABORATORY VIII - Memory Management I

    • Memory Management

      • Examples&Exercises:

    • Memory Arrangement

      • Examples&Exercises:

    • Implementing Files

    • Implementing Directories

    • Shared Files

    • Log-Structured File Systems

    • Disk Space Management

  • Example File Systems

    • The MS-DOS File System

  • OPERATING SYSTEMS LABORATORY IX - Memory Management II

    • MOSS Simulator

• INPUT/OUTPUT

  • Principles of I/O Hardware

    • I/O Devices

    • Device Controllers

    • Memory-Mapped I/O

    • Direct Memory Access (DMA)

  • Principles of I/O Software

    • Programmed I/O

    • Interrupt-Driven I/O

    • I/O Using DMA

  • I/O Software Layers

    • Device Drivers

    • Device Independent I/O Software

  • OPERATING SYSTEMS LABORATORY X - Files and Directories I

    • Examples&Exercises:

  • OPERATING SYSTEMS LABORATORY XI - File System II

    • MOSS Simulator

• Deadlocks

  • Resources

    • Preemptable and Nonpreemptable Resources

    • Resource Acquisition

  • Introduction to Deadlocks

    • Conditions for Deadlock

    • Deadlock Modeling

  • The Ostrich Algorithm

  • Deadlock Detection and Recovery

    • Deadlock Detection with One Resource of Each Type

    • Deadlock Detection with Multiple Resource of Each Type

    • Recovery from Deadlock

  • Deadlock Avoidance

    • Resource Trajectories

    • Safe and Unsafe States

  • Deadlock Prevention

  • Summary of Deadlock strategies

  • OPERATING SYSTEMS LABORATORY XII - I/O Efficiency

    • Examples&Exercises:

  • References:

  • Vita

• About this document ...

Text Book

Required

Readings will be assigned in Modern Operating Systems, 3rd Edition by Andrew S. Tanenbaum, Prentice Hall, 2008.

Recommended

Another frequently used text book that covers the same material with a different approach is Operating System Concepts, 8th Edition by Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, John Wiley and Sons, January 2008.

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

Grading Criteria

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

• Quiz:

• Lab: 15%

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