http:^^www.cs.umass.edu:80^~mckinley^377^

This data set contains WWW-pages collected from computer science departments of various universities

Date: Wednesday, 20-Nov-96 23:21:08 GMT
Server: NCSA/1.3
MIME-version: 1.0
Content-type: text/html
Last-modified: Friday, 08-Nov-96 19:03:39 GMT
Content-length: 6116

<title>CS 377 Operating Systems </title>

<H2>  CS 377 Operating Systems   </H2>


<h4>Instructor</h4>
<ul>
<li><!WA0><a href="http://www.cs.umass.edu/~mckinley/">Kathryn S. McKinley</a>
([e-mail])  <br>
Office:  LGRC 357, x5-2410<br>
Office Hours:  M: 11:00-12:00, W: 9:00-10:00
</ul>

<h4>TA</h4>
<ul>
<li> Archna Kalra  ([e-mail])  <br>
Office: LGRC 305, x5-4753 <br>
Office Hours: in 224 LGRT, Tu: 4:00-5:00pm, and F: 9:00 - 10:00am  <br>
Recitation:  323 LGRT, W: 5:00-6:00pm
</ul>

<h4><!WA1><a
href="http://www.cs.umass.edu/~mckinley/377/lectures.html">
Detailed Schedule and On-line Lecture Notes</a></h4><p>

<h4>Project</h4>

<ul>

<li> <b> Materials </b> 

<ul>

<li>

 <!WA2><A
HREF="http://www.cs.umass.edu/~mckinley/377/nachos.ps">  
Laboratory Instructions:</A> How to Use Nachos in the Edlab

<li>
Thomas Narten, <!WA3><A
HREF="http://www.cs.duke.edu/~narten/110/nachos/main/main.html"> 
``A Road Map Through Nachos''</A>

<li>
Reading: Schilberschatz & Galvin, ``Operating Systems Concepts,''
Appendix The Nachos System 

<li>
Thomas Anderson, <!WA4><A HREF="http://http.cs.berkeley.edu/~tea/c++example/c++.ps">
``A Quick Introduction to C++''</A>

</ul>

<li> <b> Assignments </b> 

<ol>
<li> <!WA5><a href="http://www.cs.umass.edu:80/~mckinley/377/lab1.ps">   Threads</a>

<li> <!WA6><a href="http://www.cs.umass.edu:80/~mckinley/377/lab2.ps">   Multiprogramming</a> 

<li> <!WA7><a href="http://www.cs.umass.edu:80/~mckinley/377/lab3.ps">   Virtual Memory</a> 

</ol>
</ul>

<h4>Homeworks</h4>

<ol>
<li>  <!WA8><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk1.ps">  Homework 1</a> (Available: 9/13/96) - 
<!WA9><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk1soln.ps"> Solution</a>  (DUE: 9/20/96)

<li>  <!WA10><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk2.ps">  Homework 2</a> (Available: 9/30/96) - 
<!WA11><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk2soln.ps"> Solution</a>  (DUE: 10/7/96)

<li>  <!WA12><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk3.ps">  Homework 3</a> (Available: 10/18/96)  -
<!WA13><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk3soln.ps"> Solution</a>  (DUE: 10/25/96)

<li>  <!WA14><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk4.ps">  Homework 4</a> (Available: 11/4/96)  -
<!WA15><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk4soln.ps"> Solution</a>  (DUE: 11/13/96)

<li>  <!WA16><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk5.ps">  Homework 5</a> (Available: 11/??/96)  -
<!WA17><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk5soln.ps"> Solution</a>  (DUE: 11/??/96)

<li>  <!WA18><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk6.ps">  Homework 6</a> (Available: 12/2/96)  -
<!WA19><a href="http://www.cs.umass.edu:80/~mckinley/377/hwk6soln.ps"> Solution</a> (DUE: 12/9/96)

</ol>


<h4>Description</h4>


This course is about operating systems.  Roughly speaking, the
operating system provides a well-known, convenient, and efficient
interface between user programs and the bare hardware of the computer
on which they run.  The operating system is responsible for allowing
resources (e.g., disks, networks, and processors) to be shared,
providing common services needed by many different programs (e.g.,
file service, the ability to start or stop processes, and access to
the printer), and protecting individual programs from one another.
The course will start with a brief historical perspective of the
evolution of operating systems over the last fifty years, and then
cover the major components of most operating systems.  This discussion
will cover the tradeoffs that can be made between performance and
functionality during the design and implementation of an operating
system.  Particular emphasis will be given to three major OS
subsystems: process management, memory management, and the file
system, and operating system support for distributed systems.


<h4>Requirements and Grading</h4>
<ul>
<li> 6 Homeworks (15\%)

<li> 3 Programming Projects (45\%)

<li> 3 Exams (40\%) - in-class, open book, and open notes
<ul>
<li> Exam 1: first 1/3 of course
<li> Exam 2: second 1/3 of course
<li> Final Exam: 75% on final 1/3 of course and 25% over first 2/3s
of course
</ul>
</ul>

The course will be graded on a curve.  You are expected to attend
class regularly, read the assigned reading before class, and
participate in class discussions.



<h4> Late Policies </h4> 


This course covers a lot of material.  To make it easier to learn, I
have divided the course into many small components.  This division
means late assignments will seriously impact your ability to learn the
next section of the course.  Therefore, I have the following strict
late policies.

<ul>
<li> <b> Homework </b> - no late homeworks will be accepted.  Since several
homeworks are due right before an exam, the solutions will be
published on the day the homework is due and therefore, no late
assignments will be accepted.  I give homeworks to enable you to apply
what you are learning in class before an exam.  They are not a large
portion of your grade, but doing homework will improve your
performance on exams (a much larger portion of your grade), and it is
therefore to your benefit to do all the homeworks and turn them in on
the deadline.  Again, regardless of the circumstances, you will not
get any credit for late homework assignments.


<li> <b> Labs </b> - If you turn in your lab late, you will receive a 10\%
penalty for each day after ({\em or portion thereof}\/) that the
assignment was due, up to three days.  Individual extensions without
penalty will be granted only in extreme circumstances (serious illness
with a doctor's note, ...).  It is unfair to the rest of the class if
I give certain individuals extensions, so plan accordingly and start
on your assignments early.


<li> <b> Exams </b> - If you will miss an exam or a significant amount
of class time, you <b> must </b> tell me ahead of time.  Make up exams
will be oral, and, based on previous experience, will be tougher than
the original exam.

</ul>

<h4>Cooperation and Cheating</h4>

Feel free to discuss homework and labs with other members of the
class, myself or the TA.  However, <b>do not look at or copy another
students solution to a homework or lab</b>.  I am not concerned with
how you come to understand the problem and how to solve it, but once
you have the background necessary to solve it, you must provide your
own solution.  Exchanging homework or lab solutions is cheating and
will be dealt with according to University policies.

<h4>
<!WA20><a href="http://www.cs.umass.edu/~mckinley/377/intro.ps"> Complete
Syllabus and Course Policies</a> </h4>

<h4>Acknowledgements</h4>

I used course materials from Tom Anderson, John Carter, Hank Levy, and
Thomas Narten to prepare the lecture notes, homeworks, labs, and
exams. Thanks!