Question: Question 1 - ( based on 1 1 . 1 2 and 1 1 . 1 6 , p . 5 2 7 ) [
Question based on and p
Ex p: Suppose that a disk drive has cylinders, numbered to The drive is currently serving a request at cylinder and the previous request was at cylinder The queue of pending requests, in FIFO order, is:
;;;;;;;;;
Starting from the current head position, what is the total distance in cylinders that the disk arm moves to satisfy all the pending requests for each of the following diskscheduling algorithms?
a FCFS
b SCAN
c CSCAN
Ex p: Assume that you have a configuration comprising disks organized as RAID level and RAID level disks. Assume that the system has flexibility in deciding which disk organization to use for storing a particular file. Which files should be stored in the RAID level disks and which in the RAID level disks in order to optimize performance?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
