RYERSON UNIVERSITY

SCHOOL OF COMPUTER SCIENCE

CPS 590:Introduction to Operating Systems

W I N T E R 2 0 11

            PROFESSOR:�������� B. Nagendra�����������������������������������
E-MAIL:�������� ����������� rnagendr@scs.ryerson.ca
OFFICE:������������������� ENG244
LECTURES:�����������
TEXT:����������� LINUX PROGRAMMING STONES and MATTHEW

Course Website: TBD ��� ����������������������������������� ���� ���
Prof Website: http://www.scs.ryerson.ca/~rnagendr/cps590.html

REFERENCES:
1.�������� Operating Systems Concepts, Policies and Mechanisms by Pinkert and Wear, Prentice Hall.
2. ������� Operating Systems Principles by Per Binch Hansen, Prentice Hall.

EVALUATIONS:������

Term Work	Weight	Date
Mid-term	35%	Friday March 4^th, 2011.
Final Exam	35%	Exam week
*2 Assignments + Lab marks	30%	TBA

Weight of Lab and Assignment Marks:������

x= (Exam + Mid-term %) /100	Multiply (Assignments + Lab %) by f
x < 0.30	F=0
0.30 < x < 0.70	F= -3.33x2 + 6.08x - 1.53
x > 0.70	F= 1.0

** There is NO supplemental examination for this course**

ASSIGNMENT POLICY:

 Assignments will be marked in two parts.� The first part will be a demo in your lab hour and the second will be part
will be an electronic submission of code.� Details on submission will be given before the assignment due date.

Submit all assignments before 3:10 p.m. on the due date foo your lab section. Late assignments are not accepted. Please try to complete and hand in your assignments in advance or the due date, as no excuses are accepted for late assignments, including: "the computer went down last night!" All assignments must include your Name, Student I.D., Course, Section, Professor (and group members- if applicable).

TEST POLICY:

Missing a test for any reason results in a mark of 0 for that test, with the following exception: you missed the test because of illness and have a dated doctor�s note stating that you were too ill to attend class, and stating the expected duration of your illness.

TEST REMARKING POLICY

All remarking requests to be submitted using form provided on course website.� Papers completed in pencil cannot be remarked.� All remarking request are to be submitted within one week of test being return.

CHEATING POLICY:

First Offence: cheating on an assignment, lab, or test will result in a mark of 0 on that assignment, lab or test. Your name will be recorded for future reference.

Repeated Offences: too horrible to think or (if you really want to know, see the student conduct booklet.)

Be careful: handing in a program that is a modified version of someone else�s program constitutes cheating! So does giving your program to someone else to modify!

ANNOUNCEMENTS:

Announcements will be made periodically in class regarding assignments, tests, test dates, due dates, due date changes, etc. It is your responsibility to find out about any announcements you may have missed.

Ensure that you check both the course and professor�s website regularly for announcements.

TOPICS:

1. Introduction to O/S���������������������������

System Calls

Interrupts, Synchronous and Asynchronous traps��������������

Operating System Structure

2. Using Processes

Introduction to Processes

Interprocess Communications

Classical IPC Problem

Process Scheduling

ending a process

3. Primitive Communications

signals

signals and signal Management calls

4. Pipes

Unamed pipes

Named pipes

5. Message Queues

Creating a Message Queue

Message Queue Operations

6. Semaphores

Creating & accessing semaphores

Semaphore operations

7. Shared Memory

Creating a shared memory segment

Shared memory control

Shared memory operations

8. Remote Procedure Calls ����� (Time permitting)

Transforming a local function into a RPC

Using Broadcasting to search for an RPC service

9. Memory Management

Virtual Memory

Paging; Paging & Segmentation

Page Replacement Policies (FIFO, LRW, etc)

10. File Systems

Files

Directories

File System Implementation

Security