CSE 430 Operating System (Spring 2011)

Lecture T, TH 6:00 P.M. - 7:15 P.M. BYAC 150
Instructor Georgios Varsamopoulos
Office BY514
Email Georgios.Varsamopoulos@asu.edu
Office Hours TBA
TA Wei Wu(weiwu2010@asu.edu)
Office BY531AB


CONTENTS

ANNOUNCEMENT

  • A student must check this web page regularly.

COURSE DESCRIPTION

Goal and Topics
Operating system sturcture and services, processor scheduling, concurrent processes, synchronization techniques, memory management, virtual memory, input/output, storage management, and file system.

Syllabus
This is the syllabus for the course of this semester. It is same as the one uploaded in the BlackBoard.

Grading
The following grading rubric will be used to evaluate all the submitted material and performance tasks:


A+ 97%-100%
A 94%-96%
A- 90%-93%
B+ 87%-89%
B 84%-86%
B- 80%-83%
C+ 76%-79%
C 70%-75%
D 60%-69%
E <60%
The final letter grade will be assigned based on weighted average of the grades obtained in the following categories:

Homeworks will be given the grade using this Rubric.
Assignment 20%
Project, Exam(highest) 25%
Quizes 10%
Midterms 20% each
In-class participation 5%
Notice: the above description is not finalized and subject to change. Student should check back this page on a regular basis.


ASSIGNMENTS

Assignment Points Date Assigned Due Date Files
Homework Assignments



Homework #1
Jan. 18th 2011 Jan. 25th 2011 Research Assignment(See the last page of the fisrt Slide)
Exe 1.17, 1.18, 1.19, 1.25, 1.26
Homework #2
Feb. 3rd 2011 Feb. 15th 2011 PDF
Homework #3
Mar. 1st 2010 Mar. 11th 2010 PDF
Quiz



Quiz #1
Jan. 27th 2011

Quiz #2
Feb. 10th 2011

Quiz #3
Mar. 3rd 2011

Quiz #4
Mar. 24th 2011

Quiz #5
Apr. 7th 2011

Project
Progress Report Apr. 4th 2011
Final Report
Apr. 29th 2011
Mid-term 1
03/10/2011
Mid-term 2
04/14/2011
Final exam
05/05/2011


LECTURE NOTES

Week Class # Date Topics Materials
1 1 01/18 - Introduction to the Course & Introduction to Operating Systems - Chapter 1
- Slides
- Basic writing advice
2 01/20 - History of Operating Systems
- Overview of Operating System structure and architecture
- Chapter 2
- Slides
2 3 01/25 - Processes and their memory layout
- System Calls
- Creation and life cycle of processes
- Sections 3.1—3.3
- Slides
- test_memory.c
- wait_test.c
4 01/27 - Process Creation
- Inter-process communication(IPC)
- Sections 3.3—3.6
- Slides
3 5 02/01 - Introduction to threads - Chapter 4.1—4.2
- Slides
6
02/03
- Homework 1
- Threads
- Chapter 4.3—4.4
- Slides
4 7
02/08 - Probability Review - Slides
8
02/10  - Types of schedulers, metrics, Gantt chart
- Chapter 5.1—5.2
- Slides
5 9
02/15 - Scheduling policies - Chapter 5.5—5.7
- Slide
10
02/17
No slide.
6 11
02/22 - Process Synchronization - Chapter 6.4—6.5
- Slide
12
02/24

7 13
03/01 - Deadlock, Priority Inversion, Priority Inheritance
- Bounded-buffer Problem, Readers-writers Problem
- Dining Philosophers Problem, Monitors
- Slide
14
03/03 - Quiz 3

8 15
03/08 - (Chapter 7) Deadlocks and the conditions for their occurence
- Slides
16
03/10 - Midterm Exam

10 19
03/15 SPRING BREAK
20
03/17
11 21
03/22 - Problem Discussion

22
03/24 - Quiz 4

12 23
03/29 - Problem Discussion

24
03/31 - Contiguous memory, memory fragmentation
- fitting,virtual memory, frames and pages
Slide
13 25
04/05 - Project Progress Demonstration

26
04/07 - Quiz 5

14 27
04/12 - Virtual memory and Page table

28
04/14 - Midterm 2

15 29
04/19 - Page Table Problem Discussions

30
04/21 - Page Table Problem Discussions

16 31
04/26 - Poster Session

32
04/28 - Poster Session

17 33
05/03 - Final Exam Review





REFERENCE

  • Operating System Concepts by A. Silberschatz, P. B. Galvin and G. Gagne


RESOURCES

POLICY ON CHEATING

Any incidence of cheating in this class will be severely dealt with. This applies to homework assignments, programming assignments, quizzes and tests. The minimum penalty for cheating will be that the student will not obtain any credit for that particular assignment. (This means that if in a test and/or assignment a student is found have cheated, he/she will obtain zero in that test and/or assignment.) For the homework and the programming assignments students may discuss the problems with others, but one is expected to turn in the results of one's own effort (not the results of a friend's efforts). One tends to get very suspicious if two identically wrong results show up in the homework assignment and/or tests. The names of the offenders will be maintained in the departmental files. The repeat offenders may be debarred from the University.









Home | Projects | People | Publications | Courses | Resources | Contact