Disk Scheduling

Why disk scheduling?

Multi programming, many
process may be generating
requests for reading and
writhing disk records
Request become faster than
they can be serviced by
moving head disk, waiting
lines or queues build up for
each device.(FCFS)
Ordering the queue for request in
some manner called disk scheduling
Examine the requests
Determine the most efficient
way to service the request
Service with minimum
mechanical motion
Characteristics
Seek Time the time for the
disk arm to move the heads
to the cylinder containing
the desired sector
Rotational Latency-the
additional time waiting for
the disk to rotate the
desired sector to the disk
Disk bandwidth-total no
bytes transferred divided by
the total time between the
first request for the
service and the completion
of the last transfer.
 FCFS
Response time become larger
It ignores positional
relationship
SSTF(shortest Seek Time First)
Higher variance occurs on
response time, due to
discrimination against the
outer most and innermost
track
Starvation of requests
Good in Batch processing
SCAN
To overcome the high
variance in response time
Shortest distance in a
preferred direction
Outward goes up to the end
as no request in that
direction (elevator
algorithm)
Inward Sweep
C-SCAN
The arms moves from the outer
cylinder to the inner
cylinder, serving requests on
shortest seek basis.
Inward sweep completed it
jumps to the request nearest
the outermost cylinder, and
then resumes the inward
sweep.
 LOOK Scheduling
The arms goes only as far as the
final request in each direction.
It reverses direction immediately
without going all the way to the
end of the disk