Operating Systems (Spring 2016)
This class is taught by Jay McCarthy. Call him Jay. Email him at first-name DOT last-name AT gmail DOT com.
We meet in Olsen 402 at 0930-1045.
Jay McCarthy’s office hours are MWF 0700-1130 TR 0900-1530 in Olsen 221.
There is a mailing list hosted at Google Groups. Use it to ask non-revealing questions and receive answers, as well as general course announcements. You are responsible for reading the content of this mailing list.
1 Introduction
Presents an introduction to major operating systems and their components. Topics include processes, concurrency and synchronization, deadlock, processor allocation, memory management, I/O devices and file management, and distributed processing. Techniques in operating system design, implementation, and evaluation will be examined.
2 Lectures
| Day |
| Date |
| Topic |
| Links |
| Notes |
| 1 |
| 01/19 |
| Introduction |
|
| MO 1 (slides) | |
| 2 |
| 01/21 |
| Processes & Threads |
|
| MO 2-2.1 (slides) | |
| 3 |
| 01/26 |
| Threads & IPC Problems |
|
| MO 2-2.2 (slides) | |
| 4 |
| 01/28 |
| IPC Problems cont. |
|
| ||
| 5 |
| 02/02 |
| Synchronization |
|
| MO 2-2.3 (slides) | |
| 6 |
| 02/04 |
| Scheduling |
|
| ||
| 7 |
| 02/09 |
| Finish Chapter 2 |
|
| MO 2 (slides) | |
| 8 |
| 02/11 |
| Deadlock |
|
| MO 6 (slides) | |
| 9 |
| 02/18 |
| Memory Management |
|
| MO 3-3.2 (slides) | |
| 10 |
| 02/23 |
| Memory Management |
|
| MO 3-3.3 (slides) | |
| 11 |
| 02/25 |
| Exam 1 Review |
|
| (slides) | |
| 12 |
| 03/01 |
| Exam 1 |
|
| See Exam 1* | |
| 13 |
| 03/03 |
| Page Replacement |
|
| MO 3-3.4 (slides)* | |
| 14 |
| 03/08 |
| Page Replacement |
|
| MO 3-3.4 (slides) | |
| 15 |
| 03/10 |
| VM Design Issues |
|
| MO 3-3.5 (slides) | |
| 16 |
| 03/22 |
| VM Implementation Issues |
|
| MO 3-3.6 (slides) | |
| 17 |
| 03/24 |
| File Systems |
|
| MO 4-4.2 (slides) | |
| 18 |
| 03/29 |
| File Systems |
|
| MO 4-4.3 (slides) | |
| 19 |
| 03/31 |
| File Systems |
|
| MO 4-4.4 (slides) | |
| 20 |
| 04/05 |
| Finish Chapter 4 |
|
| MO 4 (slides) | |
| 21 |
| 04/07 |
| Exam 2 Review |
|
| (slides) | |
| 22 |
| 04/12 |
| Exam 2 |
|
| See Exam 2 | |
| 23 |
| 04/14 |
| Virtualization & the Cloud |
|
| MO 7-7.4 | |
| 24 |
| 04/19 |
| Exam 2 Recap and Virtualization |
|
| MO 7-7.11 | |
| 25 |
| 04/21 |
| Finish Chapter 7 |
|
| MO 7 | |
| 26 |
| 04/26 |
| Final Review |
|
| (slides) | |
| 27 |
| 04/28 |
| Final Review |
|
| (slides) | |
| 28 |
| 05/03 |
| Final @ 8am in normal room. See Final |
|
|
Jay will not be present on days marked with a * in the Notes column.
This schedule is likely to change.
3 Assignments
| Assignment |
| Code |
| Out |
| Due |
|
| a1 |
| 01/19 |
| 02/02 | |
|
| a2 |
| 01/28 |
| 02/11 | |
|
| exam1 |
|
|
| 03/01 | |
|
| a3 |
| 02/11 |
| 03/03 | |
|
| a4 |
| 03/03 |
| 03/29 | |
|
| exam2 |
|
|
| 04/12 | |
|
| a5 |
| 03/29 |
| 04/14 | |
|
| a6 |
| 04/14 |
| 04/28 | |
|
| e1 |
|
|
| 05/03 | |
|
| final |
|
|
| 05/03 |
Out dates are suggestions—
This schedule may change.
4 Turn-In and Grading
I highly recommend that you read this article about grading. I also recommend you read this article about the stress that you may experience in a computer science program. Please try to make healthy productive choices in your life. I would love the opportunity to help you in any ways I can.
4.1 Bitbucket
Create a Bitbucket account if you do not have one.
Create a repository named 2016-Spring-91.308.
Ensure it is configured as a Git repository that is private. You can configure it with No forks, if you want.
Click on Settings and then click on Access management then add me (username: jeapostrophe) to the repository with the Read permission.
Initialize the repository by following the instructions on the Bitbucket site.
As you work on assignments, you should create a directory in the repository with the name of assignment and do all your work in that directory. You should commit and push often. I will watch over your shoulder and try to give you advice as you work. Thus, the more you push, the easier it will be for you, because you’ll get more attention from me. This video is a good tutorial on Git.
4.2 Turn-in
You turn in your assignments by tagging a revision on Bitbucket and then emailing me a link to the tag. Both of these things should be done before 6PM Lowell time on the due date listed. If either is late (even by a single second), it will not be graded. This is a real due date and due time. Please use this early due time to get a good night’s sleep and enjoy your evenings.
You should tag the revision with code of the assignment. You should email the link to me with [CS308] code as the subject, where code is the code listed on the assignment table under the Code column. Do not send multiple emails and do not make multiple tags.
Your email should contain nothing else in it.
Turn-ins that are not in the correct format will not be graded.
4.3 Assignment Scores
Each assignment’s page describes how it will be graded. All assignments will receive a grade from the closed interval between 0 and 1.
4.4 Exam Policy
Exams must be taken in person, at the scheduled time, and must be turned in on stapled-together paper with your writing on it as produced by your hand and a pen or pencil, except in special situations as required by students with special needs.
Exams must be completed without any notes, books, or resources of any kind, except for one single-sided hot-pink 3-inch-by-5-inch index card, such as is available from Amazon. No other colors or sizes are acceptable.
Each exam will receive a grade from the closed interval between 0 and 1.
4.5 Numeric Grade
I will take your various points and combine them with this function to get a numeric grade:
> (define (sum l) (foldl + 0 l))
> (define (average l) (/ (sum l) (length l)))
> (define (combine a1 a2 a3 a4 a5 a6 exam1 exam2 final) (+ (* 0.4 (average (list exam1 exam2))) (* 0.2 final) (* 0.4 (average (list a1 a2 a3 a4 a5 a6)))))
> (combine 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0) 0.0
> (combine 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5) 0.5
> (combine 0.5 0.6 0.7 0.8 0.9 1.0 0.5 0.9 1.0) 0.78
> (combine 1.0 1.0 1.0 1.0 1.0 1.0 0.8 0.8 0.8) 0.8800000000000001
> (combine 1.0 1.0 1.0 1.0 1.0 1.0 1.0 1.0 1.0) 1.0
4.6 Letter Grade
> (define (convert-to-letter ng) (cond [(> ng 0.93) "A"] [(> ng 0.9) "A-"] [(> ng 0.86) "B+"] [(> ng 0.83) "B"] [(> ng 0.8) "B-"] [(> ng 0.76) "C+"] [(> ng 0.73) "C"] [(> ng 0.7) "C-"] [(> ng 0.66) "D+"] [(> ng 0.6) "D"] [else "F"]))
> (convert-to-letter 1) "A"
> (convert-to-letter 0.94) "A"
> (convert-to-letter 0.899999) "B+"
> (convert-to-letter 0.81) "B-"
> (convert-to-letter 0.74) "C"
> (convert-to-letter 0.6999999) "D+"
> (convert-to-letter 0.62) "D"
> (convert-to-letter 0.57) "F"
5 Help
My job is to help you.
If you need a "shallow" amount of help, then look at the Google Group. First, see if I have already answered your question. Then, send your own email.
Only send me personal email if you need to talk about something private, such as your grades. Anything else is best discussed in public, so others can benefit. If you do send personal email, put [CS308] as a prefix in the subject.
If you need a "deep" amount of help, please come to my office or call me (801-361-0732) and we’ll talk and try to resolve whatever ails you.
6 Readings
(MO) We’ll be using the book Modern Operating Systems (4th Edition), by Andrew S. Tanenbaum and Herbert Bos (Amazon link).
You are expected to procure MO yourself. It is available in digital formats. I highly recommend searching for it.
7 Software
The programming assignments should be written in C.
If you’d like a refresher on C, I recommend this tutorial and if you want an in-depth study, I suggest Learn C the Hard Way.
I highly suggest that you learn to do all your editting and programming in either Emacs or Vim and do everything using the command-line.
I highly suggest that you do all your work on your personal Linux computer. If you do not have one, I highly suggest that you download the free VirtualBox VM software along with a free pre-built image of a distribution like Ubuntu. I do not recommend using the department servers.
Finally, I’d like you to do all your work on a Bitbucket repository that you share with me, so make sure you get yourself set up with that.
8 Fine Print
In this course, all work is to be each student’s own. Students should therefore be familiar with the University’s rules on academic dishonesty, which can be found in the Bulletin of Undergraduate Studies and in the Schedule of Classes. In particular, plagiarism will not be tolerated! Any student caught plagiarizing another’s work will automatically receive a grade of F for the course. If you are unsure as to what constitutes plagiarism, it is your responsibility to check with the instructor. Other forms of dishonesty will result in similar actions. You may collaborate with your classmates on the design and results of the programs you will write in this course, but each student must implement these programs alone. Submission of shared student code is not permissible, and will result in a grade of F for the course. Help files are typically provided for each programming assignment, and students are encouraged to cut and paste useful code from these help files into their assignment submissions, but all other code must be the specific work of each student.
This course is based on 91.308 by Prof. Moloney.