CS 1550 – Intro to Operating Systems
Summer Term: 2187
|
|
Class |
Recitation |
Recitation |
|
Time: |
2:30 PM - 4:15 PM |
4:30 PM – 5:20 PM |
1:30 PM – 2:20 PM |
|
Days: |
TH |
T |
H |
|
Room: |
5129 Sennott Sq. |
5502 Sennott Sq. |
G-13 CL |
|
Webpage: |
|||
|
Instructor: Jonathan Misurda |
|
TA: Xiaoting Li |
||
|
Office: |
6203 SENSQ |
|
Office: |
6805 SENSQ |
|
Email: |
|
Email: |
||
|
Office Hours: |
TH 1:00 – 2:30 |
|
Office Hours: |
Mon, Wed: 9:00am – noon |
Modern computer software can run without specific knowledge of the underlying components of the physical machine. For instance, a program such as Microsoft Word can run on computers with varying amounts of RAM and can print a document without needing to know the make and model of the target printer. Physical resources such as memory and peripheral hardware are managed by the computer’s Operating System software. This course examines the abstractions that an Operating System provides to user-level software, and how to most efficiently allocate resources between competing programs. Specifically, we will examine how to share and manage the CPU, memory, persistent storage, I/O devices, and communications.
Successful completion of CS 0447 – Computer Organization and Assembly Language and CS 0449 – Introduction to Systems Programming is required to enroll in CS 1550. Exemptions to the prerequisites are rarely given. If you have any questions about the prerequisite material for the course, please ask at the beginning of the term.
This course is intended to introduce the fundamental concepts that modern operating systems use to manage the physical computer. Beyond the concepts introduced in lecture, course projects will take one such operating system, Linux, and examine source code. Students will be asked to implement additional features into the core of the operating system, known as the kernel.
By the end of the course, students will be able to:
A. Silberschatz, P.B. Galvin, and G. Gagne, Operating System Concepts, 9th Edition, John Wiley & Sons, Inc., 2012.
ISBN: 1-11-806333-3
Exams: There will be a midterm and a final. Both will be given during class time. The exams will be closed book/notes.
Cheating on exams will not be tolerated. Anyone caught cheating will be given a zero for the test and reported to the department following University procedures.
At the risk of seeming like a Luddite, Smart Watches are banned on test days.
Projects: There will be four out-of-class assignments given. These are to be completed in the given time (no extensions will be given without a valid excuse. LATE WORK IS NOT ACCEPTED. Contact me before the deadline for clarifications.) These are meant to be your own work; anyone found to be collaborating will be disciplined in accordance to University policy. Cheating means (but is not limited to): using code from previous terms, other universities, your friends, finding it on the Internet, getting help from unapproved forums, or outsourcing it.
We will be using Moss, a tool from Stanford to help catch unauthorized collaboration this term.
Quizzes: There will be short, unannounced quizzes to make sure you are keeping up with the class material.
Participation: Attendance will not be taken, but in such a small class, any absence will be noticed. Several unexcused missed classes will adversely affect your grade.
Your grade will be based upon 2 exams, 3 projects, quizzes (the lowest one of which will be dropped), and participation:
|
Midterm Exam |
20% |
|
Final Exam |
20% |
|
Project 1 |
5% |
|
Project 2 |
10% |
|
Project 3 |
10% |
|
Project 4 |
15% |
|
Quizzes |
10% |
|
Participation |
10% |
|
Total |
100% |
The scale for the term will be:
|
Percentage |
100 |
95 |
90 |
89 |
85 |
80 |
79 |
75 |
70 |
69 |
65 |
60 |
< 60 |
|
Letter |
A+ |
A |
A- |
B+ |
B |
B- |
C+ |
C |
C- |
D+ |
D |
D- |
F |
If you have a disability for which you are requesting an accommodation, you are encouraged to contact both your instructor and Disability Resources and Services, 216 William Pitt Union, (412) 648-7890, as early as possible in the term. DRS will verify your disability and determine reasonable accommodations for this course.
Students are expected to comply with the University of Pittsburgh’s Policy on Academic Integrity. Any student suspected of violating this obligation for any reason during the semester will be required to participate in the procedural process as outlined in the University Guidelines on Academic Integrity. For further information see: http://www.pitt.edu/~provost/ai1.html
Term Schedule The daily topics are subject to change depending on our pace. They are there to assist you in the readings so you can focus on those concepts prior to class.
|
Week 1: 5/15/2018 - 5/17/2018 |
|
Readings for this week: Chapters 1,2
Topics: · History of OS · System Calls
|
|
Week 2: 5/22/2018 - 5/24/2018 |
|
Readings for this week: Chapters 3, 4, 5
Monday, May 21: Add/Drop Ends
Topics: · Processes and Threads · Scheduling
|
|
Week 3: 5/29/2018 – 5/31/2018 |
|
Readings for this week: Chapters 6, 7
Topics: · Deadlock avoidance and prevention
|
|
Week 4: 6/5/2018 - 6/7/2018 |
|
Readings for this week: Chapter 8
Topics: · Memory Management · Swapping
|
|
Week 5: 6/12/2018 - 6/14/2018 |
|
Readings for this week: Chapter 9
Topics: · VM · Review for midterm
|
|
Week 6: 6/19/2018 - 6/21/2018 |
|
Readings for this week: Prepare for the midterm
Thursday, June 21: Midterm Exam
Topics: · Finish the discussion of VM
|
|
Week 7: 6/26/2018 - 6/28/2018 |
|
Readings for this week: Chapter 13
Topics: · Page replacement algorithms · I/O – DMA, Interrupts, Polling · Disks
|
|
Week 8: 7/3/2018 - 7/5/2018 |
|
Readings for this week: Chapter 10
Friday, July 6: Monitored Withdrawal Deadline
Topics:
|
|
Week 9: 7/10/2018 - 7/12/2018 |
|
Readings for this week: Chapters 11, 12
Topics: · Files · File Systems · File System Implementations · FAT vs. i-nodes
|
|
Week 10: 7/17/2018 - 7/19/2018 |
|
Readings for this week: Chapters 14, 15
Topics:
|
|
Week 11: 7/24/2018 - 7/26/2018 |
|
Readings for this week: Chapter 16
Topics:
|
|
Week 12: 7/31/2018 - 8/2/2018 |
|
Readings for this week: Prepare for the final exam
Thursday, August 2: Final Exam
Topics: · Review for the final exam
|