CS 503: Operating Systems Spring 2003

• D. E. Comer and T. Fossum. Operating system design: The XINU approach, PC Edition. Prentice-Hall Inc. 1988. ISBN: 0-13-638180-4

  The slides corresponding to this book are available for purchase from University Bookstore, 360 W. State Street. These slides will NOT be made available on the web page.

• Silberschatz, Galvin and Gagne. Operating system concepts. Addison-Wesley. 6th edition. 2002. ISBN: 0-471-41743-2 (recommended)

  You can find the slides for Silberschatz and Galvin here.

• Other Useful Books (most of them available at the library):
  • The Design of the Unix Operating System. Maurice Bach.
  • Advanced Programming in the UNIX Environment. Stevens.
  • Linux Kernel Internals. Michael Beck et al.
  • Solaris Internals: Core Kernel Architecture. Jim Mauro et al.
  • UNIX Network Programming, volumes 1 and 2. Stevens.
  • Internetworking with TCP/IP, Vol. III. Comer and Stevens.
  • Distributed Operating Systems. Tanenbaum.

• Intel Manuals
  • Volume 1
  • Volume 2
  • Volume 3

• GNU Assembler Manual

• Brennan's Guide to Inline Assembly and AT&T assembly

• Details on AT&T assembly

• Sonia Fahmy, office: CS 118, e-mail: fahmy@cs.purdue.edu, phone: (765) 49-46183

Office Hours:

• T W Th 1:30--2:30 PM, and by appointment

• Tomasz Czajka, office: PHYS 11, e-mail: tczajka@cs.purdue.edu, phone: 49-62796, office hours: W 1:00--2:00 PM; PSOs M 9:30 AM and 1:30 PM, in CS 257
• Puneet Zaroo, office: CS G18, e-mail: zaroo@cs.purdue.edu, phone: 496-3159, office hours: Th 3:00-4:00 PM; PSO M 3:30 PM, in CS 257

PSOs:

Students are strongly encouraged to attend PSO sessions. (PSOs won't start to meet until announced in class.) If you have to swap a PSO session with someone, find that someone and notify your TA. If you have to remove a registration schedule conflict, officially notify Dr. Gorman.

Prerequisites:

Graduate standing in Computer Science, CS 502, previous operating system class at the undergraduate level (CS 354 or equivalent), ability to read and understand a large non-trivial system written in C, ability to program extensively in C, and command a suite of system development tools.

Credit:

03

Programming assignments (scaled according to length)	50%
Midterm (March 6th, in class)	25%
Final exam (even if taking quals only, you MUST take both the final exam and the additional questions) Wednesday, May 7th, 2003, 7 PM--9 PM, room BRNG 2290	25%

Labs and Policies:

We will use the XINU operating system for the programming assignments. The XINU lab is located in the Computer Science Building room CS 257.

For account-related questions, please contact Candace Walters (e-mail: clw@cs.purdue.edu, phone: (765) 49-49206, CS 210).

Due Dates

All assignments are due on the dates and times specified. It is the student's responsibility to manage their time so that the assignments can be submitted before the deadline. To accomodate unseen schedule conflicts and difficulties, each student is given two flexible days for the whole semester, to submit any work late. Do not feel compelled to use them, but use them when necessary. It is the student's responsibility to keep track of the number of late days remaining for him/her this semester. There is no need to e-mail the instructor or TAs in order to use your late days: simply submit your lab late. Note that submitting a lab a few minutes late counts as a full late day-- we do not count fractions; we round up to the nearest day.

Any submission that is later then the specified due date and time will be returned ungraded.

Academic Dishonesty

We wish to foster an open and collegial class environment. At the same time, we are vigorously opposed to academic dishonesty because it seriously detracts from the education of honest students. Because of this, we have the following standard policy on academic honesty, consistent with Purdue University's official policy.

• It is permissible to discuss a general method of solution with other students, or to make use of reference materials in the library or online. If you do this, you will be expected to clearly disclose with whom you discussed the method of solution, or to cite the references used. Failure to do so will be considered cheating or plagiarism. The use of "method of solution" means a general discussion of technique or algorithm, such as one would reasonably expect to occur standing in front of a whiteboard, and precludes the detailed discussion of code or written assignments. Specifically, looking at another student's code on his/her computer monitor is NOT allowed.
• Unless otherwise explicitly specified, all written assignments or code that is submitted is to be entirely the students own work. Using any code or copying any assignment from others is strictly prohibited without advance prior permission from the instructor. This includes the use of code others have submitted in the past.
• All students work is their own. Students who do share their work with others are as responsible for academic dishonesty as the student receiving the material. Students are not to show work to other students, in the class or not. Students are responsible for the security of their work and should ensure that printed copies are not left in accessible places, and that file/directory permissions are set to be unreadable to others (e.g. use "chmod -R 700 *" from your home directory). If you need assistance protecting your work, please contact your TA or instructor.
• Students who encourage others to cheat or plagiarize, or students who are aware of plagiarism or cheating and do not report it are also participating in academically dishonest behavior.
• Be aware that we will use a software tool called MOSS (http://www.cs.berkeley.edu/~aiken/moss.html) to check for copying among submitted assignments. Additionally, the instructor and TAs will be inspecting all submitted material to ensure honesty.

Any case of academic dishonesty will be dealt with by a severe grade penalty in the overall class grade and referral to the office of the Dean of Students.

You can find the lab REGRADE POLICY here.

Classroom Policy:

Class participation and discussions are strongly encouraged. However, please be considerate to others: avoid coming to class late, leaving early, talking to other students, etc.

Mailing Lists/Newsgroup:

Questions should be posted on the newsgroup: news:purdue.class.cs503. Urgent questions that concern the whole class can be sent to cs503@cs.purdue.edu. Please do not send to the cs503 mailing list unless you are certain that the matter concerns the whole class and needs immediate attention. The instructor and TAs will use the mailing list for important announcements, so make sure to check your e-mail frequently.

Please subscribe to the mailing list using the command (type this at the prompt from a CS account): mailer add me to cs503
Do: "man mailer" for more information on the mailer utility.

Make sure that you check the newsgroup and your e-mail frequently. Do NOT post answers to the assignments or test cases, though general clarifications/hints are OK. Complaints about the assignments or the class should not be posted to the newsgroup or mailing list-- they should be emailed to the instructors/TAs. The instructors and TAs can be reached by email at 503ta@cs.purdue.edu.

CS Ph.D. Qualifier:

This course is one of the courses for Qual I of the CS Ph.D. program. Additional questions will be given on the final exam for students wishing to take the qualifier.

Useful Links:

• UNIX/sockets/C/C++/PERL/JAVA manuals
• C++ FAQ
• GNU documentation tree
• SIGOPS- ACM Special Interest Group on Operating Systems
• IEEE Computer Society
  • Technical Committee on Operating Systems (TCOS)
• IEEE Communications Society
  • Technical Committee on Computer Communications (TCCC)
  • Internet Technical Committee (ITC)
• SIGMETRICS- ACM Special Interest Group on Performance Evaluation
• Operating System Links
• Malloc/Free and GC Implementations
• mmap() example
• Virtual memory and replacement algorithms
  • Slides from Yale (PDF)
  • Slides from Duke (PDF)
  • Examples from various operating systems
• UNIX files, showing open() and dup() operation (esp. figure 7)
• Books
  • BookPool
  • Powell's
  • Amazon.com
  • Barnes & Noble
• Tiny OS web page