4/7/2024 0 Comments Look scheduling algorithm![]() among these disk scheduling algorithms, the algorithm that yields less number of head movement will remain has an efficient algorithm.In this research paper, we propose a new disk scheduling algorithm that will reduce the number of movement of head thereby reducing the seek time and it improves the disk bandwidth for modern storage devices. Several disk scheduling algorithms are available to service the pending requests. if the hardware is busy, we can't service the request immediately and the new request will be placed in the queue of pending requests. To support this in disk drive, the hardware must be available to service the request. In order to service these requests, hardware (disk drive and controller) must be used efficiently. Since memory management allows multiprogramming so that operating system keeps several read/write request in the memory. ![]() we can meet this goal using fast access time and large disk bandwidth that depends on the relative positions of the read-write head and the requested data. One of the main goal of the operating system for the disk drives is to use the hardware efficiently.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |