• edited by
20,041 views
55 55 votes

An application loads $100$ libraries at startup. Loading each library requires exactly one disk access. The seek time of the disk to a random location is given as $10$ ms. Rotational speed of disk is $6000$ rpm. If all $100$ libraries are loaded from random locations on the disk, how long does it take to load all libraries? (The time to transfer data from the disk block once the head has been positioned at the start of the block may be neglected.) 

  1. $0.50 \ s$
  2. $1.50 \ s$
  3. $1.25 \ s$
  4. $1.00 \ s$

2 Answers

Best answer
88 88 votes

$\text{Disk access time} =\text{Seek time}+\text{Rotational latency}+\text{Transfer time}$ (given that transfer time is neglected)
$\text{Seek time}=10 \text{ ms}$
$\text{Rotational speed}=6000 \text{ rpm}$

  • $60\;s \to 6000 \text{ rotations}$
  • $1 \text{ rotation}\to 60/6000 \;s$
  • $\text{Rotational latency} =1/2 \times 60/6000 \;s =5 \text{ ms}$

Total time to transfer one library $=10+5=15 \text{ ms}$
$\therefore$ Total time to transfer $100$ libraries $=100 \times 15 \text{ ms}=1.5 s$

Correct Answer: $B$

• edited by
0 0 votes

The total physical time required for a single random disk access consists of three distinct parts: seek time to move the arm, rotational latency to find the sector, and the data transfer time.

$$\text{Total Time per Access} = \text{Seek Time} + \text{Rotational Latency} + \text{Transfer Time}$$

The problem states that the data transfer time from the disk block once the head is positioned may be completely neglected.

$$\text{Transfer Time} = 0 \text{ ms}$$

The seek time to position the disk head over a random target track is explicitly given as a fixed value:

$$\text{Seek Time} = 10 \text{ ms}$$

To calculate the rotational latency, we first find the total time required for the platter to complete one single 360-degree rotation using the speed of 6000 rpm:

$$\text{Time for 1 rotation} = \frac{60 \text{ seconds}}{6000} = 0.01 \text{ seconds} = 10 \text{ ms}$$

Because the libraries are scattered across random locations, we must use the standard average rotational latency, which corresponds to the time taken for half of a full platter rotation:

$$\text{Average Rotational Latency} = \frac{\text{Time for 1 rotation}}{2} = \frac{10 \text{ ms}}{2} = 5 \text{ ms}$$

Combining these elements gives the average time penalty incurred for every individual random library access:

$$\text{Total Time per Access} = 10 \text{ ms (Seek)} + 5 \text{ ms (Latency)} + 0 \text{ ms (Transfer)} = 15 \text{ ms}$$

The application needs to load a total of 100 independent libraries from completely random disk locations at startup.

We find the total loading time by multiplying the number of libraries by our computed single random access time:

$$\text{Total Time} = 100 \times 15 \text{ ms} = 1500 \text{ ms}$$

Converting this duration from milliseconds into seconds yields the final metric:

$$\text{Total Time} = \frac{1500}{1000} \text{ seconds} = 1.50 \text{ s}$$

Correct Option: B

Answer:
Position:
Show:

Related questions

77 77 votes
4 answers 4 answers
24.7k
24.7k views
go_editor asked Sep 29, 2014
24,746 views
On a non-pipelined sequential processor, a program segment, which is the part of the interrupt service routine, is given to transfer $500$ bytes from an I/O device to mem...
43 43 votes
5 answers 5 answers
20.5k
20.5k views
go_editor asked Sep 29, 2014
20,465 views
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$$$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arriva...
59 59 votes
7 answers 7 answers
39.2k
39.2k views
go_editor asked Sep 29, 2014
39,192 views
Let the page fault service time be $10$ milliseconds(ms) in a computer with average memory access time being $20$ nanoseconds (ns). If one page fault is generated every $...
83 83 votes
5 answers 5 answers
29.4k
29.4k views
go_editor asked Sep 29, 2014
29,395 views
A thread is usually defined as a "light weight process" because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to ...