Scribd
Upload
119 views7 pages

Disk Scheduling

SSTF, SCAN, LOOK, and C-SCAN are disk scheduling algorithms that help optimize hard drive performance. SSTF scheduling prioritizes the request closest to the disk head, reducing seek time. SCAN scheduling services requests in a back-and-forth pattern across the disk to prevent long wait times. LOOK scheduling reverses the scan direction when no requests remain in one direction. C-SCAN scheduling only moves the head in one direction and skips requests not in its path, making it best for low utilization systems. The most appropriate algorithm depends on a system's throughput, wait time, and head movement needs.

Uploaded by

69Sujal Verdhan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
119 views7 pages

Disk Scheduling

SSTF, SCAN, LOOK, and C-SCAN are disk scheduling algorithms that help optimize hard drive performance. SSTF scheduling prioritizes the request closest to the disk head, reducing seek time. SCAN scheduling services requests in a back-and-forth pattern across the disk to prevent long wait times. LOOK scheduling reverses the scan direction when no requests remain in one direction. C-SCAN scheduling only moves the head in one direction and skips requests not in its path, making it best for low utilization systems. The most appropriate algorithm depends on a system's throughput, wait time, and head movement needs.

Uploaded by

69Sujal Verdhan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Disk

Scheduling
Disk scheduling algorithms help to optimize the performance of hard
drives, which are slow compared to the CPU. In this presentation, we
will learn about the different types of disk scheduling
algorithms and compare their performance.
First-Come, First-Serve
Scheduling (FCFS)

How it Performanc
Works e
FCFS scheduling works by scheduling FCFS scheduling is not well-suited for
input/output requests in the same order they high- throughput systems because of
are received. It's simple to implement but can the long wait times. However, it can be
result in very long wait times if some an excellent choice for low-utilization
requests take longer to complete than systems or those that are not frequently
others. accessed.
Shortest Seek Time First
Scheduling (SSTF)
How it Works Performance
Variations
SSTF scheduling works SSTF scheduling Several variations of
by scheduling the provides excellent SSTF scheduling include
input/output request performance for most the elevator algorithm,
that is closest to the systems, although it which improves
read-write head of the can cause increased performance by
disk. It's designed to wait times for some limiting the head's
reduce the amount of requests that are movement in a single
time the head needs to significantly farther direction and the
seek the next request, from the head of the circular scan algorithm,
resulting in improved disk than others. which treats the disk
performance for high- However, the tradeoff like a circular list and
throughput systems. is generally well worth avoids extreme head
it for most systems. movements.
SCAN
Scheduling 1 How it
Works
SCAN scheduling works by

Performanc 2 scheduling I/O requests in a back


and forth "scratching" pattern across
e
SCAN scheduling can be an the disk from the innermost to
excellent choice for systems outermost tracks. When an end of
where individual requests can the disk is reached, the direction
become very long and result in is reversed. This helps to prevent
extended wait times. However, individual requests from creating
it can result in some requests long wait times.
being skipped if they are not in
the current 3 Variations
scanning direction. The circular-scan algorithm is a
variation of scan scheduling that
treats the disk like a circular list.
This avoids issues with requests
being skipped as they are always
included in the scan.
LOOK
Scheduling

How it Performanc
Works e
LOOK scheduling is a variant of SCAN LOOK scheduling is an excellent option
scheduling where the direction of the for high- throughput systems as it
scan is reversed when there are no more avoids the head movements associated
requests to be serviced in one direction. with SCAN scheduling.
This helps to avoid costly head movements However, it can still suffer from some of
in the event that a request comes in from the issues associated with SSTF scheduling,
another area of the disk. including longer wait times for extreme
requests.
C-SCAN
Scheduling 1 How it
Works
C-SCAN scheduling is a variant of

Performanc 2 SCAN scheduling where the


read/write head only moves in
e
C-SCAN scheduling is well- one direction, and only services
suited for low-utilization requests that are ahead in the
systems, as it can lead to long direction of the head. When the end of
wait times for requests that are the disk is reached, the head
not currently being serviced. It's also jumps back to the beginning of
useful in certain systems where the disk and starts over.
processes need guarantees about
the maximum wait 3 Variations
time they will experience. Circular C-SCAN scheduling is a
variation that treats the disk like
a circular list, avoiding the issue of
skipped requests caused by the
linear nature of C-SCAN
scheduling.
Comparison of Disk
Scheduling Algorithms
Wait Time Throughput Head Movement

FCFS scheduling Long Low High

SSTF scheduling Short High Medium

SCAN scheduling Medium Medium Low

LOOK scheduling Medium High Low

C-SCAN scheduling Long Low Low

Each disk scheduling algorithm has its own strengths and weaknesses, making it important to
carefully consider the specific needs of your system when choosing an appropriate algorithm. SSTF
scheduling provides excellent performance for most systems, although it can cause increased wait
times for some requests that are significantly farther from the head of the disk than others.
SCAN scheduling can be an excellent choice for systems where individual requests can become
very long and result in extended wait times.

You might also like