Problem 1 [50 pts] Consider a hard disk drive that has 5 double-sided platters, each surface has...

80.2K

Verified Solution

Question

Programming

Problem 1 [50 pts]
Consider a hard disk drive that has 5 double-sided platters,each surface has 1000 tracks, each track has 256 sectors of size512 bytes. Each block (disk page) comprises of 8 sectors. The seektime between adjacent tracks in 1ms and the average seek timebetween two random tracks is 25ms. The disk rotates at a speed of7200 rpm (revolutions per minute).
Letâ€™s say, we have a file of size 1 MB and it contains 2048equal-sized records.
1. What is the size of a block? How many records fit in a block?How many blocks are required to store the
entire file?
2. What is the capacity of each cylinder?
3. What is maximum time (worst case) to read two blocks from thedisk (the blocks to be read are part of the same read request andno external factors affect the read latency)?
4. If the file is stored â€œsequentiallyâ€, how long will it taketo read the whole file? Assume that for sequential writes data arewritten in adjacent tracks once a track is full.
5. If the blocks in the file are spread â€œrandomlyâ€ across thedisk, how long will it take to read the whole file?

Answer & Explanation Solved by verified expert

4.1 Ratings (737 Votes)

Things given in the qn No of double sided platters 2 surfaces upper surface and lower surface 5 Each surface contains 1000 tracks Each track contains 256 sectors Each sector contans 512 bytes Each block contains 8 sectors Block size 8 512 4096 bytes Seek time between adajacent tracks 1 ms Seek time is time taken to move from one track to another is called seek time Avg seek See Answer

Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:

Unlimited Question Access with detailed Answers
Zin AI - 3 Million Words
10 Dall-E 3 Images
20 Plot Generations
Conversation with Dialogue Memory
No Ads, Ever!
Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!

Become a Member