# Question: Consider a disk with N tracks numbered from 0 to

Consider a disk with N tracks numbered from 0 to (N – 1) and assume that requested sectors are distributed randomly and evenly over the disk. We want to calculate the average number of tracks traversed by a seek.

a. Calculate the probability of a seek of length j when the head is currently positioned over track t.

b. Calculate the probability of a seek of length K, for an arbitrary current position of the head.

c. Calculate the average number of tracks traversed by a seek, using the formula for expected value

d. Show that for large values of N, the average number of tracks traversed by a seek approaches N / 3.

a. Calculate the probability of a seek of length j when the head is currently positioned over track t.

b. Calculate the probability of a seek of length K, for an arbitrary current position of the head.

c. Calculate the average number of tracks traversed by a seek, using the formula for expected value

d. Show that for large values of N, the average number of tracks traversed by a seek approaches N / 3.

**View Solution:**## Answer to relevant Questions

The following equation was suggested both for cache memory and disk cache memory: TS = TC + M * TD Generalize this equation to a memory hierarchy with N levels instead of just 2. It should be clear that disk striping can improve the data transfer rate when the strip size is small compared to the I/O request size. It should also be clear that RAID 0 provides improved performance relative to a single ...Define: B = block size R = record size P = size of block pointer F = blocking factor; expected number of records within a block Give a formula for F for the three blocking methods depicted in Figure. Consider the organization of a UNIX file as represented by the inode. Assume that there are 12 direct block pointers, and a singly, doubly, and triply indirect pointer in each inode. Further, assume that the system block ...Figure is a listing of code intended for use on the eCos kernel. a. Explain the operation of the code. Assume thread B begins execution first and thread A begins to execute after some event occurs. b. What would happen if ...Post your question