CSC 469F | Course Home Page and Overview | Fall 2006

News

• December 1:
  • Command to format C code for printint was truncated on the assignment handout. The full command is:

    seawolf% enscript --mark-wrapped-lines=box --header='demke|$n|page $% of $=' -C \
    --highlight=c -p A3.ps client.h client_main.c client_recv.c client_util.c
    

    Make sure you replace 'demke' with your team's login ids in the header argument.
• November 29:
  • As of 4pm, chatserver will fail and restart on a new CDF wolf host with new port numbers every 10 minutes.
• November 27:
  • See assignments page for additional notes on Assignment 3.
• November 20:
  • Assignment 3 is now available on the assignments page.
• November 6:
  • Reminder: No lecture Tuesday, November 7, double-lecture Thursday, November 9. No tutorial this week.
• November 5:
  • Assignment 2 is now available on the assignments page.
• November 1:
  • Assignment 0 is now available for pickup from the box outside my office.
• October 22:
  • Brief notes on the midterm test and a set of sample test questions are available on the "Tests" section.
• October 17:
  • Minor changes to original A1 code distribution (as of 12:09 p.m.) Check assignments page for details.
• October 13:
  • There are some bugs in the code framework for A1 that I'd like to shake out before distributing to the class. Hence, the assignment will run from Monday, October 16 to Tuesday, October 31 (Halloween? Coincidence?). You will be writing a multithreaded program where threads update records in a shared hash table in response to various events. If you want to get a head start, I recommend looking at Tom Hart's memory reclamation performance lab, particularly the files that deal with hash tables (hash.[ch]), and linked lists (list_*.c), and the implementations of different locking or lockless strategies (qsbr.[ch] == quiescent-state-based-reclamation == RCU outside the Linux kernel, mcslock == Mellor-Crummey Scott queueing locks, spinlock.h == vanilla spinlocks with backoff).
• October 6:
  • As announced in class Tuesday, A0 is extended to Tuesday October 10, 5:00 p.m. The assignment page has been updated with submission instructions and additional information on the OS X system (not required, but data is available).
• September 29:
  • Simple reservation system for benchmarking machines is now available. See the web page for instructions.
• September 21:
  • The first assignment has been posted.

General Information

Course Information Sheet ( pdf )

Instructor: Angela Demke Brown (demke469@cs.toronto.edu)

Teaching Assistant: Thomas Hart

Class Meetings:

Newsgroup:
ut.cdf.csc469h
Read it at news://newssrv.cdf.utoronto.ca/ut.cdf.csc469h,
Post to it at mailto:ut.cdf.csc469h@news.cdf.utoronto.ca).

Prereqs

• CSC369
• CGPA 3.0/enrolment in a CSC subject POSt

Marking Scheme

• 4 assignments - 50% (10%, 10%, 15%, 15%)
• First Term Test - 20%
• Second Term Test - 25%
• Class Participation - 5%

Textbook

There is no required textbook for this course, however, background on concepts can be found in any standard operating systems text. It is assumed that you have a copy of "Operating System Concepts" used in CSC369 and suggested readings will refer to Sections in the 7th Edition of this text.

Operating System Concepts, Seventh Edition Abraham Silberschatz, Peter Baer Galvin and Greg Gagne John Wiley & Sons, Inc. ISBN: 0-471-69466-5

Course Description

From the Undergraduate Calendar:

An in-depth exploration of the major components of operating systems with an emphasis on the techniques, algorithms, and structures used to implement these components in modern systems. Project-based study of process management, scheduling, memory management, file systems, and networking is used to build insight into the intricacies of a large concurrent system.