Question: Task 3. Assume that a hard disk drive has 3 double-sided platters. There are 20000 tracks on each recording surface, with 1000 sectors on each

 Task 3. Assume that a hard disk drive has 3 double-sided

Task 3. Assume that a hard disk drive has 3 double-sided platters. There are 20000 tracks on each recording surface, with 1000 sectors on each track (there is no ZBR). The sector size is 500 byte. The average seek time is 4 ms. By measurements we have determined that the average service time of read requests aiming a single sector is 10 ms. (a) What is the total capacity of the HDD in CHS coordinate system? b) What is the rotation speed (in RPM) if we assume that the data transmission through the interface and command processing are infinitely fast? (c) How long does it take to read a sector from the recording surface, once the head and the disc are at the appropriate position? (d) Assume that the command processing time is 0.1 ms and the transmission speed of the interface is 50 106 byte/s. What is the (random) throughput measured by 2000 byte long read requests? What is the (sequential) throughput measured by 50 106 byte long read requests? Task 3. Assume that a hard disk drive has 3 double-sided platters. There are 20000 tracks on each recording surface, with 1000 sectors on each track (there is no ZBR). The sector size is 500 byte. The average seek time is 4 ms. By measurements we have determined that the average service time of read requests aiming a single sector is 10 ms. (a) What is the total capacity of the HDD in CHS coordinate system? b) What is the rotation speed (in RPM) if we assume that the data transmission through the interface and command processing are infinitely fast? (c) How long does it take to read a sector from the recording surface, once the head and the disc are at the appropriate position? (d) Assume that the command processing time is 0.1 ms and the transmission speed of the interface is 50 106 byte/s. What is the (random) throughput measured by 2000 byte long read requests? What is the (sequential) throughput measured by 50 106 byte long read requests

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!