Disk Scheduling using Heap |
Author(s): |
| Anuj Victor , SHIATS, Allahabad; Er Prateek Singh, SHIATS, Allahabad; Bhawana Singh, INVERTIS UNIVERSITY, BARIELLY |
Keywords: |
| Disk scheduling, heap, seek time, FCFS, SSTF, Priority |
Abstract |
|
Now-a- days processor speed and memory size are increasing with the advent of new technologies. Disk I/O performance has become mandatory factor concerning system performance. Seek time is a crucial factor in scheduling the disk requests. Increase in seek time degrade the system performance. Since the disk requests are linked in queues so there is a need of more efficient disk scheduling algorithms. The paper stores the disk requests in an array and forms a heap. Requests are served by performing the preorder traversal on the heap. Use of heap helps in dynamically handling the disk requests. |
Other Details |
|
Paper ID: IJSRDV3I70008 Published in: Volume : 3, Issue : 7 Publication Date: 01/10/2015 Page(s): 158-160 |
Article Preview |
|
|
|
|
