Question

Suppose we want to read k blocks that are randomly placed/stored in a disk cylinder i....

Suppose we want to read k blocks that are randomly
placed/stored in a disk cylinder i. These blocks could be on the same surface or
different surfaces of cylinder i. Determine, on average, how far around the track must
we go to read these k blocks.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Answer:

Let the radius of track closest to disk cylinder be r1 and that of farthest track be r2.

So, the average radius will be (r1 + r2)/2.

On average, each time disk head had to wait half of the rotation to reach the correct sector where it can perform the read or write operation. (Sometime it reaches there too early so it had to wait for less than half rotation and when it reaches there late it has to wait for more than half rotation to reach the desired sector on the track.)

average distance = [ 1/2 * (2 * * (r1 + r2)/2 ) ] * k

                             = [ * (r1 + r2)/2 ] * k

So, on average it must go [*(r1+r2)/2]*k around the track to read these k blocks.

Note: Here we have not include the distance travelled by the head during reading the sector as sector length is not given ie, (number of sectors per track).

Add a comment
Know the answer?
Add Answer to:
Suppose we want to read k blocks that are randomly placed/stored in a disk cylinder i....
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Suppose that a file requires 20 blocks to be stored in disk. For each of the...

    Suppose that a file requires 20 blocks to be stored in disk. For each of the following allocation strategies( contiguous, linked, indexed), determine the number of disk block we need to read to bring in block 7 into memory after reading the file’s directory header?

  • Assume a rather old disk drive is configured as follows. The total storage is divided among...

    Assume a rather old disk drive is configured as follows. The total storage is divided among 32 surfaces. There are 2048 tracks per sector. There are 512 sectors per track. There are 512 Bytes per sector. The interleaving factor is 4. The disk turns at 7200 rpm. The average startup time for the read/write arm is 15 ms and the average time to move the arm is 0.2 ms per track. Now assume that there is 8 MB file on...

  • Question 12 Consider a magnetic disk drive with 10 double sided platters, 512(=2^9) tracks per surface,...

    Question 12 Consider a magnetic disk drive with 10 double sided platters, 512(=2^9) tracks per surface, and 1024 (=2^10) sectors per track. Sector size is 2KBytes (=2^10 Bytes ). Assume the average seek time 0.02 ms, the seek time from a track to its adjacent track can be ignored. The drive rotates at 5400 rpm. Successive tracks in a cylinder can be read without head movement. Furthermore, disks can be handled independently, so multiple tracks in a cylinder can be...

  • I want solution is not written in cursive... It's too hard to recognize. Thanks. Exercise 4.17: Suppose that we have...

    I want solution is not written in cursive... It's too hard to recognize. Thanks. Exercise 4.17: Suppose that we have n jobs to distribute among m processors. For simplicity, we assume that m divides n. A job takes 1 step with probability p and k > 1 steps with probability 1 - p. Use Chernoff bounds to determine upper and lower bounds (that hold with high probability) randomly assign exactly n/m jobs to each processor when all jobs will be...

  • Could you please try to explain to me how we get the solution because I want...

    Could you please try to explain to me how we get the solution because I want to understand the solution so that to be solved step by step including all of the details If the conditions for a time-invariant optimal control law are satisfied by a linear regulator problem, the constant K matrix must be a solution of the nonlinear algebraic equations Using this result, determine the optimal control laws for: a) The first-order system x(t)-ax(t) + u (t) with...

  • A shelter has 24 dogs up for adoption. Suppose you want to adopt 2 of them....

    A shelter has 24 dogs up for adoption. Suppose you want to adopt 2 of them. How many different ways could you choose 2 dogs from the 24?   We are interested in analyzing data from bike sharing in LA. Use O to denote a one-way route and A to denote an annual pass. The probability that someone has a one-way trip route is 84.74%. The probability that they have an annual pass is 2.77%. The probability that they have an...

  • C++ i want Lab#3 done can u make clear code so I could understand it. Lab#2The...

    C++ i want Lab#3 done can u make clear code so I could understand it. Lab#2The objective of this lab is compare the populations of various cities that lie in between Toledo and Dayton on I-75. Write a program that produces a bar illustrating the populations. The program should read the name of the city and its population from a file. Have the program continue this process until the end of file is reached. For each city, your program should...

  • Array manipulation (a) Write Java code for a method exchange (int [] a, int i, int...

    Array manipulation (a) Write Java code for a method exchange (int [] a, int i, int j) that exchanges the values stored at indices i and j in the array a. You do not need to worry about cases where either i or j is an invalid index. Give the best estimate you can for its time complexity (b) In an ordered array of n items, how can we determine whether or not an item belongs to the list using...

  • Hey guys, I need some help solving this problem. thank you very much in advance! Pontfolio Optimization Task 4 Suppose the shares of two different companies give you the same return on average...

    Hey guys, I need some help solving this problem. thank you very much in advance! Pontfolio Optimization Task 4 Suppose the shares of two different companies give you the same return on average. Does it make sense to distribute your money and buy some shares of each company? Or would it be better to invest all the money into only a single company? Common sense says: "distribute" Why? Let's see... What at all could we gain if the return is...

  • i just wanna double check whether i answered correct or not please. Why do we measure...

    i just wanna double check whether i answered correct or not please. Why do we measure the volume of the flask in this experiment with water rather than using the volume listed on the side? Select all correct answers that apply. Must include all correct answers for full credit. The volume is not accurate on a flask to the number of significant figures required for this experiment The volumetric markings on the flask do not extend to it's full height...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT