hw04 - CS 411 Operating Systems II Homework Assignment #4...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 411 Operating Systems II Spring 2009 Homework Assignment #4 To be discussed in class Given a disk drive with 5000 cylinders, numbered 0 to 4999. Assume that the disk head is positioned at cylinder 1023, and the previous request was at cylinder 1088. The table below shows a reference string (i.e., a queue of disk I/O requests by cylinder locations in the order received ). Note: Here’s a table of “distances” Request # 1 2 3 4 5 6 7 8 Cylinder # 1106 4192 1515 138 1672 2960 120 861 1. Obviously, FCFS would handle the requests in the same order as they were received. List the request numbers in handling-order for the other disk-scheduling algorithms. Algorithm
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.
Ask a homework question - tutors are online