Disk Scheduling:
Disk Scheduling Algorithms are used to reduce the
total seek time of any request.
Disk Scheduling: in Computer we can Perform Many Operations at a Time so that Management is also necessary on all the Running Processes those are running on the System at a Time. With the help or Advent of the Multi-programming we can Execute Many Programs at a Time. So fir Controlling and providing the Memory to all the Processes Operating System uses the Concept of Disk Scheduling.
FCFS Disk
Scheduling
The simplest form of disk scheduling is the
first-come, first-served (FCFS) algorithm. It is fair but generally does not provide the fastest service.
It services all the requests close to the current head
position before moving the head far away to service other requests. SSTF chooses the pending request closest to the
current head position
Scan Scheduling
SCAN algorithm, the disk arm starts at one end of the
disk and moves toward the other end, servicing requests as it reaches each
cylinder, until it gets to the other end of the disk. SCAN algorithm is sometimes called the elevator algorithm, since the disk arms behaves just like an elevator in a
building, first servicing all the requests going up and then reversing to
service requests the other way.
Comments