Assume we have a hard disk with 300 cylinders (numbered 0 to 299) with the disk head starting at cylinder 120 (moving toward cylinder 299). We have the following queue of hard disk requests: 160, 230, 100, 80, 180, 200, 240, 290. Draw a diagram below (as in Figure 1) showing the movement of the head over time for the FCFS algorithm, and calculate the total movement of the disk head (in cylinders). (Assume that no other requests for cylinders arrive while this algorithm is executing.) Figure 1: Disk Scheduling for FCFS algorithm (see image attached ) Assume we have the same hard disk as problem III(b). For reference, the disk has 300 cylinders (numbered 0 to 299) with the following queue of hard disk requests: 160, 230, 100, 80, 180, 200, 240, 290. Draw a diagram below (like Figure 1) showing the movement of the head over time for the SCAN algorithm, and calculate the total movement of the disk head (in cylinders). (Assume that no other requests for cylinders arrive while this algorithm is executing.)
-
Assume we have a hard disk with 300 cylinders (numbered 0 to 299) with the disk head starting at cylinder 120 (moving toward cylinder 299). We have the following queue of hard disk requests:
160, 230, 100, 80, 180, 200, 240, 290.
Draw a diagram below (as in Figure 1) showing the movement of the head over time for the FCFS
algorithm , and calculate the total movement of the disk head (in cylinders). (Assume that no other requests for cylinders arrive while this algorithm is executing.)
Figure 1: Disk Scheduling for FCFS algorithm (see image attached ) -
Assume we have the same hard disk as problem III(b). For reference, the disk has 300 cylinders (numbered 0 to 299) with the following queue of hard disk requests:
160, 230, 100, 80, 180, 200, 240, 290.
Draw a diagram below (like Figure 1) showing the movement of the head over time for the SCAN algorithm, and calculate the total movement of the disk head (in cylinders). (Assume that no other requests for cylinders arrive while this algorithm is executing.)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
