COMP SCI 537 Midterm: CS 537 UW Madison 04 Fall Mid3
Document Summary
Please put your name and student id on this page and your student id (but not your name) on every. Part ii: long answers (2 20) 100. This exam consists solely of ve long questions, each worth 20 points (total 100): right on schedule. We now explore disk scheduling. (a) a common disk scheduling algorithm is called shortest seek time rst (sstf). Describe sstf, and what its primary problem is. (b) you develop a new algorithm, called two-queue sstf. The idea is simple: you put the rst n requests into the rst of two disk scheduling queues, and start by servicing those requests in sstf-based order. However, as the next so many requests arrive into the system, they are put into a different second queue. No request in this other queue is serviced until all of the requests in the rst queue have been.
