Computer Science 432/563
Operating Systems

Spring 2016, The College of Saint Rose

Home     Syllabus     Schedule

Agenda

• Announcements
  • Lab 2: Programming Unix Processes and Threads in C discussion, now due Wednesday night
  • Programming Project 1: Process Tree continues, remains due Thursday
  • Those unfamiliar or insufficienly comfortable working with C structs should be sure to understand them to the level required by the programming for Labs 7, 8, and 9 from CSC 381 before the next few labs for this course come along.
• CPU Scheduling
  • CPU scheduling goals
  • Relationship between response time and throughput
  • Scheduling algorithms:
    • FCFS
    • SJF/SRTF
    • Priority
    • RR

Lecture 0x05 Assignment

Due at the start of class, Wednesday, February 10.

Please submit answers to these questions either as a hard copy (typeset or handwritten are OK) or by email to terescoj AT strose.edu by the start of class. Please use a clear subject line when submitting by email (e.g., CS 432 Lecture 0x05 Assignment , Joe Student). We will discuss these questions at the start of class, so no late submissions are accepted.

No new readings. We are working on Chapter 6.

• SG&G Exercise 6.16, p. 316-317 (4 points)
• SG&G Exercise 6.20, p. 317 (3 points)

You need not submit answers to these questions, but you will have a chance to ask questions about them at the start of class.

• SG&G Practice Exercise 6.1, p. 314.
• SG&G Practice Exercise 6.3, p. 314.
• SG&G Practice Exercise 6.6, p. 315.

Examples

• sysvshmem

Links

• Paper: `Implementing Lottery Scheduling: Matching the Specializations in Traditional Schedulers,' by David Petrou, John W. Milford, and Garth A. Gibson, Proceedings of the USENIX 1999 Annual Technical Conference, Monterey, California, June 6-11, 1999