The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | May 2017 |
| Last Sign in: | 398 Weeks Ago, 2 Days Ago |
| Questions Answered: | 66690 |
| Tutorials Posted: | 66688 |
MCS,PHD
Argosy University/ Phoniex University/
Nov-2005 - Oct-2011
Professor
Phoniex University
Oct-2001 - Nov-2016
rite a program that will simulate the FCFS, SSTF, LOOK, and C-LOOK seek optimization strategies. Assume that:
a. 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.
b. A seek takes 10 + 0.1 * Tms, where Tis the number of tracks of motion from one request to the next, and 10 is a movement time constant.
c. One full rotation takes 8 ms.
d. Transfer time is 1 ms.
Â
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 |
|
35 |
198 |
7 |
|
45 |
170 |
5 |
|
57 |
180 |
3 |
|
83 |
78 |
4 |
|
88 |
73 |
5 |
|
95 |
150 |
7 |
Â
For comparison purposes, compute the average, variance, and standard deviation of the time required to accommodate all requests under each of the strategies. Consolidate your results into a table.
Optional: Run your program again with different data and compare your results.
Recommend the best policy and explain why.
Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll