CSE 421/521

Introduction to Operating Systems

Fall 2015

 

Instructor:

 

Prof. Tevfik Kosar

338J Davis Hall, 645-2323

tkosar@buffalo.edu

Office hours: Wed 11:00am-12:00pm, Thu 12:30pm-1:30pm

 

Course Description:

 

CSE 421/521 is an introductory course on the design and implementation of operating systems. It will focus on different OS design techniques, process management, processor scheduling, concurrent programming, deadlocks and synchronization, memory management, file management and I/O systems, disk scheduling, protection and security, and distributed systems. The course will include hands-on programming projects on different OS components.

(Prerequisites of this course: CSE 305, CSE 321, or permission of the instructor.)

 

Course Logistics:

 

Lecture time & location  : Tue & Thu, 11:00am – 12:20pm (Knox 104)

Recitation sessions         : Tue 3:00pm-3:50pm, Wed 10:00am-10:50am

Teaching assistants         : Sharath Chandrashekhara (sc296@buffalo.edu)

  Kyungho Jeon (kyunghoj@buffalo.edu)

  Luigi Di Tacchio (luigidit@buffalo.edu)

Final exam schedule        : December 17, Thursday, 3:30pm – 6:30pm (Knox 109)     

 

Text Book (Required):

 

v Operating Systems Concepts (9th Edition),

      by A. Silbershatz, P.B. Galvin, and G. Gayne. Wiley Publishers, 2012.

ISBN: 978-1-118-06333-0 

 

Recommended Supplementary Text: (Optional)

 

v The C Programming Language. By Kernighan and Ritchie. Prentice Hall, Second Edition, 1988, ISBN 0-13-110362-8.

 

v Advanced Programming in the UNIX Environment, by Richard Stevens. Addison Wesley Press, 1993, ISBN 0-201-56317-7.

 

 

 

Grading:

 

The end-of-semester grades for this course will be composed of:

 

v Pop Quizzes: 5%

v Projects: 40%     

v Midterm: 25%

v Final: 30%

 

* There will be separate curves for graduate and undergraduate students.

* There will be no formal attendance taken in the class. But, you are expected to attend the classes and actively contribute via asking and/or answering questions.

 

Pop Quizzes:

 

There may be pop quizzes at the beginning of some classes. The questions in the quizzes will come mostly from the material discussed in the previous lecture(s) or homework assignment(s). The quizzes will be very short (5-10 min) with one or two questions aiming to test whether you have understood the most recently discussed material in the curse. There will be 5 pop quizzes throughout the semester. One with the lowest grade will be discarded, and the rest four will count towards your final degree.

 

Homework:

 

There will be four homework assignments throughout the semester. The format of the homework questions will be similar to the exercises at the end of each chapter in the Silberschatz book. The homework assignments aim to ensure that you read the textbook and study regularly for the material covered in the class. The homework assignments will not be graded.

 

Projects:

 

There will be two hands-on programming projects throughout the course. These projects will aim to implement some core Operating System components for better understanding of the concepts. These will be ÒteamÓ projects and they will require strong programming background (in C) and UNIX programming experience.

 

Academic Integrity Policy:

 

UBÕs definition of Academic Integrity in part is, ÒStudents are responsible for the honest completion and representation of their workÓ. It is required as part of this course that you read and understand the departmental academic integrity policy located at the following URL: http://www.cse.buffalo.edu/undergrad/current_students/policy_academic.php

 

There is a very fine line separating conversation pertaining to concepts and academic dishonesty. You are allowed to converse about general concepts, but in no way are you allowed to share code or have one person do the work for others. If you are caught violating the academic integrity policy, you will minimally receive a ZERO in the course.

 

* PS: We are using professional software which can easily detect any cheating attempts in programming projects. The results generated by this software is considered as official evidence for cheating from another student, or from internet or any other resource.

 

Piazza Discussion Forum:

 

We will be using Piazza for class discussion. The system is highly catered to getting you help fast and efficiently from classmates, the TA, and myself. Rather than emailing questions to the teaching staff, I encourage you to post your questions on Piazza. Find our class page at: https://piazza.com/buffalo/fall2015/cse421521/

 

Course Schedule (Tentative):

 

This schedule is tentative and subject to change. Please check Piazza for lecture and recitation slides, homework solutions, project information, and other course related documents.

 

Date

Lect.

Title

Notes

Sep 1

1

Introduction

 

Sep 3

2

Operating System Structures

 

Sep 8

3

Processes

 

Sep 10

4

Threads

 

Sep 15

5

Project-1 Discussion

Project-1 out

Sep 17

6

CPU Scheduling – I

 

Sep 22

7

CPU Scheduling – II

 

Sep 24

8

Process Synchronization – I

 

Sep 29

9

Process Synchronization – II

 

Oct 1

10

Deadlocks – I

 

Oct 6

11

Deadlocks – II

 

Oct 8

12

Midterm Review

 

Oct 13

 

MIDTERM EXAM (Room: Knox 104)

@11:00am–12:20pm

Oct 15

13

Midterm Discussion

 

Oct 20

14

Main Memory - I

 

Oct 22

15

Main Memory – II

Project-1 due

Oct 27

16

Project-2 Discussion

Project-2 out

Oct 29

17

Virtual Memory – I

 

Nov 3

18

Virtual Memory – II

 

Nov 5

19

File Systems – I

 

Nov 10

20

File Systems – II

 

Nov 12

21

Mass Storage & I/O – I

 

Nov 17

22

Mass Storage & I/O – II

 

Nov 19

23

Distributed Systems – I

 

Nov 24

24

Distributed Systems – II

 

Nov 26

 

 

Fall Recess

Dec 1

25

Distributed Systems – III

 

Dec 3

26

Protection & Security – I

 

Dec 8

27

Protection & Security - II

 

Dec 10

28

Final Review

Project-2 due

Dec 17

 

FINAL EXAM  (Room: Knox 109)

@3:30pm–6:30pm