a) What are the following: i. Seek time ii. Search time iii. Transfer time b) In class

Fantastic news! We've Found the answer you've been seeking!

Question:

a) What are the following:
i. Seek time
ii. Search time
iii. Transfer time
b) In class it was explained that there are several seek strategies that the I/O device handler can use
to allocate access to the movable-head magnetic drives. What is/are the ultimate goal(s) of these
different seek strategies?
c) Using an appropriate data-structure, write a program (Java/C/C++) that will simulate any two of
the following seek strategies:
i. First-come, first-served (FCFS)
ii. Shortest seek time first (SSTF)
iii. LOOK
iv. C-LOOK
Assume the following:
The disk’s outer track is the 0 track and the disk contains 200 tracks per surface. Each track holds
eight sectors numbered 0 through 7.
a) A seek takes, where is the number of tracks of motion from one request to the next, and
10 is a movement time constant.
b) One full rotation takes 7 ms.
c) Transfer time is 1.2 ms per sector.
Use the following data to test your program:

Arrival Time Track Requested Sector Requested
0 45 0
23 132 6
25 20 2
29 23 1

2
35 198 7
45 170 5
57 180 3
83 78 4
88 73 5
95 150 7

NOTE:
 Each simulation should be in a separate folder.
 You are expected to add a README.md (markdown file) in each folder to
document how to run your simulation.

d) Compute the average, variance, and standard deviation of the total access time required to
accommodate all requests under each implemented seek strategy. Present this information
in a table with average, variance, and standard deviation columns and the rows as the
information for the seek strategy.