CS 2510 - Advanced Operating Systems
[Mosse]
| Class: |
MW 9:30-10:45am, SENSQ 5129 |
| Instructor: |
Prof. Daniel Mosse (mosse@cs.pitt.edu)
|
| Office Hours: |
6423 SENSQ, M W from 11:00-12:00 and 3-4:30pm |
| TA: |
Chang Liu (changliu at cs dot pitt dot edu) |
| Office Hours: |
5503 SENSQ, TH from 12:00-3:00pm (or by appointment) |
| Phone: |
412-624-8414(O) |
Projects
Announcement
NEW: Project1
has been released. Please start on it as early as possible.
Mailing
List Announcement
A class mailing list will be compiled, and will be used for important
announcements. It is VERY important that you be included in this list.
It is therefore your responsibility to e-mail one of the TAs and
request
to be included on the CS1550 class mailing list.
1st
midterm Exam March 1, 9:30am,
in the classroom
2nd midterm Exam April 19,
9:30am, in the classroom
Grading
30% Midterm exam
30% 2nd Midterm exam
30% Programming projects. The projects have an estimated
10
hours
per week for a good programmer.
There will be assignemnts and pop quizzes throughout the term. These
will be worth 10%
of your final grade.
An additional 5% bonus is possible based on class participation.
Note: You must average above 50% on the programming assignments
and
on the exams in order to pass the class. Lower than 50% on either
portion
of the class will result in a failing grade regardless of the overall
score.
List of Topics (tentative):
- Intro to advanced/dist operating systems
- Distributed Systems: architecture, motivation, issues
- Communication Models
- IPC, RPC, message passing, shared memory
- Client-Server Computing: paradigm, examples, discussion
- Threads and processes
- Distributed synchronization
- introduction, definition, models for centralized and
distributed, causal/total ordering
- implementation: lamport, ricart&agrawala, maekawa, vector
clocks, etc
- Distributed ME:
- introduction, requirements, (non- and) token-based algorithms
- generalized non-token-based algorithm
- token-based algorithm and comparisons
- Agreement Protocols
- Distributed resource management
- load balancing, load sharing
- resource allocation in real-time systems
- Principles of Fault-Tolerance (interspersed with other topics)
- coding theory (introduction along communication models)
- redundancy (introduction along scheduling and agreement
protocols)
- Principles of Security and Protection
- Distributed shared memory (time permitting)
- Distributed file systems (time permitting)
Available classnotes (PDF format <2 slides/page>):
If you have any problems viewing or downloading any of the files
on this page, drop me a line. Thank you, come again! Void where
prohibited, must be 18 or older to play, Hawaii residents add 12.4762%
sumo tax
Daniel Mosse mosse@cs.pitt.edu
Attendance
Class attendance is officially mandatory. Homeworks, assignments, and
important
dates will be posted on the class web page, but this is provided as a
courtesy
and is not always complete. It is your fault if you miss something
important
because you skipped class.
Office hours are optional. They are your chance to ask the professor
and the TA questions about the material being covered, the programming
assignments, etc.
Academic
Honesty: Collaboration vs. Cheating copied
from Ahmed Amer
This really should not be an issue, but to make things as clear as
possible the following is necessary.
You are encouraged to discuss the course material and concepts with
other students in the class. However, all work that you submit must be
your own. Under no circumstances may you look at anyone else's code or
show anyone else your code. And while you may discuss the concepts used
in the programming assignments, you may not discuss implementation
details
of the assignments themselves.
If you are caught copying or otherwise turning in work that is not solely
your own, you will fail the course.
The bottom line is that you are expected to conduct yourself as a
person
of integrity - you are expected to adhere to the highest standards of
academic
integrity. This means that plagiarism1 in any form is
completely
unacceptable. As a (soon to be) computing professional, I encourage you
to consult the code of ethics appropriate to your discipline2.
Plagiarism will be assumed until disproved on work that is
essentially
the same as that of other students. This includes identically
incorrect,
off-the-wall, and highly unusual duplicate answers where the
probability
of a sheer coincidence is extremely unlikely. All parties to this
unacceptable
collaboration will receive the same treatment.
You should bring a picture identification with you to all
examinations
and be prepared to show it upon request.
If you are unsure of what is and is not allowed by this policy,
talk
to the instructor.
1 pla-gia-rize vt. to
steal and
pass of as one's own (the ideas or words of another) to present as
one's
own an idea or product derived from an existing source - pla-gia-riz-ern.
(source: Webster's New World Dictionary).
2 The Association for Computing Machinery
is http://www.acm.org/, the IEEE is http://www.ieee.org/ and the IEEE
Computer
Society is http://www.computer.org/.
SAMPLE
MATERIALS
SAMPLE 2nd midterm study
guide here . Note
that this is just set of things that you should know. you're actually
responsible for all the stuff in the reading list (book chapters,
classnotes, handouts, and class discussions).
SAMPLE 1st midterm Exam study guide here. Note
that this is just set of things that you should know. you're actually
responsible for all the stuff in the reading list (book chapters,
classnotes, handouts, and class discussions).
OLD Project descriptions (they are in Postscript and PDF
formats):