1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
SVETLANKA909090 [29]
3 years ago
10

Consider a single-platter disk with the following parameters: rotation speed: 7200 rpm; number of tracks on one side ofplatter:

30,000; number of sectors per track: 600; seek time: one ms for every hundred tracks traversed. Let the diskreceive a request to access a random sector on a random track and assume the disk head starts at track 0.a. What is the average seek time?b. What is the average rotational latency?c. What is the transfer time for a sector?d. What is the total average time to satisfy a request?
Computers and Technology
1 answer:
horsena [70]3 years ago
4 0

Answer:

Given Data:

Rotation Speed = 7200 rpm

No. of tracks on one side of platter = 30000

No. of sectors per track = 600

Seek time for every 100 track traversed = 1 ms

To find:

Average Seek Time.

Average Rotational Latency.

Transfer time for a sector.

Total Average time to satisfy a request.

Explanation:

a) As given, the disk head starts at track 0. At this point the seek time is 0.

Seek time is time to traverse from 0 to 29999 tracks (it makes 30000)

Average Seek Time is the time taken by the head to move from one track to another/2

29999 / 2 = 14999.5 ms

As the seek time is one ms for every hundred tracks traversed.  So the seek time for 29,999 tracks traversed is

14999.5 / 100 = 149.995 ms

b) The rotations per minute are 7200

1 min = 60 sec

7200 / 60 = 120 rotations / sec

Rotational delay is the inverses of this. So

1 / 120 = 0.00833 sec

          = 0.00833 * 100

          = 0.833 ms

So there is  1 rotation is at every 0.833 ms

Average Rotational latency is one half the amount of time taken by disk to make one revolution or complete 1 rotation.

So average rotational latency is: 1 / 2r

8.333 / 2 = 4.165 ms

c) No. of sectors per track = 600

Time for one disk rotation = 0.833 ms

So transfer time for a sector is: one disk revolution time / number of sectors

8.333 / 600 = 0.01388 ms = 13.88 μs

d)  Total average time to satisfy a request is calculated as :

Average seek time + Average rotational latency + Transfer time for a sector

= 149.99 ms + 4.165 ms + 0.01388 ms

= 154.168 ms

You might be interested in
1. Write a 400-500 word research report about Burke High School.
fenix001 [56]

Answer:

when is it due

Explanation:

6 0
3 years ago
What is a logical grouping of related records called?.
irakobra [83]

Answer:

File

Explanation:

Files are frequently classified by the application for which they are primarily used (employee file). A primarily key in a file is the field whose value identifies a record among others in a data file

6 0
3 years ago
What does it mean "Be Proactive"?
joja [24]

Answer:controlling a situation by making things happen or by preparing for possible future problems

Explanation:

4 0
3 years ago
Read 2 more answers
Two technicians are discussing engine valve timing. Technician A says that the optimum valve timing is found through experimenta
nordsb [41]
The answer is B. A only. The optimum valve timing is found through experimentation using an engine dynamometer. The timing of the opening and closing of the valves is called valve timing. So the use of dynamometer measures the power output of a machine that is why it can measure the optimum valve timing.
7 0
3 years ago
Read 2 more answers
A data structure to store trees with an arbitrary number of children at each node is: public class TreeNode / Integer data, Tree
Ulleksa [173]

Answer:

TreeNode minimum(TreeNode root) {

   if (root != null) {

       if (firstChild == null && nextSibling == null) {

           return root;

       } else {

           TreeNode begin = minimum(root.firstChild);

           TreeNode last = minimum(root.nextSibling);

           if (begin == false && (last == false || begin.data < last.data)) {

               return begin;

           } else {

               return last;

           }

   } else {

       return null;

   }

}

Explanation:

The Java program defines a recursive method called minimum that calls itself twice with the first and last leaf of the treenode as the respective arguments. and returns the minimum value of the treenode if the root argument is not undefined.

5 0
3 years ago
Other questions:
  • When designing a website, describe 3 best practices you would give to your fellow classmate on effective web design that will ma
    9·1 answer
  • In a series circuit, electrons only flow along one path. Given this information, which of the following is an advantage of serie
    15·2 answers
  • What is the exposition of the movie inside out
    13·2 answers
  • Part 1: 1) Write a C program getPhoneNumber.c that accepts a phone number from the user in the form XXX-XXX-XXXX, and then displ
    12·1 answer
  • Complete the sentence about entering and editing data in a cell in a spreadsheet.
    13·1 answer
  • Brainly bug <br> i had to take a pic because it said it was rude
    10·1 answer
  • Question 13(Multiple Choice Worth 5 points)
    6·1 answer
  • Which disipline involves creating computer networks
    13·2 answers
  • Who would win in a fight, Noble 6 from halo reach or Master Chief??
    6·2 answers
  • a domain name is assigned to you when you submit your website to a search engine. group of answer choices true false
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!