Disk scheduling algorithms

Disk scheduling algorithms optimize hard disk performance by

determining the order of disk access requests to minimize disk arm
movement (seek time) and improve I/O throughput. Common
algorithms include FCFS (First-Come, First-Served), which is fair but
inefficient, and SSTF (Shortest Seek Time First), which improves
performance by selecting the closest request but can cause
starvation. SCAN (or Elevator) and C-SCAN (Circular Scan) are more
advanced, directional algorithms that balance performance and
fairness by sweeping across the disk, with C-SCAN providing more
uniform wait times.

Disk scheduling algorithm

• 1. FCFS disk scheduling algorithm-It stands for 'first-come-
first-serve'. As the name suggests, the request that comes first
will be processed first and so on. The requests coming to the
disk are arranged in a proper sequence as they arrive. Since
every request is processed in this algorithm, so there is no
chance of 'starvation'.
• 2. SSTF disk scheduling algorithm-It stands for 'Shortest seek
time first'. As the name suggests, it searches for the request
having the least 'seek time' and executes them first. This
algorithm has less 'seek time' as compared to the FCFS
Algorithm path.
• 3. SCAN disk scheduling algorithm:In this algorithm, the head
starts to scan all the requests in a direction and reaches
the end of the disk. After that, it reverses its direction and
starts to scan again the requests in its path and serves them.
Due to this feature, this algorithm is also known as the
"Elevator Algorithm".
• 4. C-SCAN disk scheduling algorithm:It stands for "Circular-
Scan". This algorithm is almost the same as the Scan disk
algorithm but one thing that makes it different is that 'after
reaching the one end and reversing the head direction, it
starts to come back. The disk arm moves toward the end of
the disk and serves the requests coming into its path.
• 5. LOOK the disk scheduling algorithm:In this algorithm, the
disk arm moves to the 'last request' present and services
them. After reaching the last requests, it reverses its direction
and again comes back to the starting point. It does not go to
the end of the disk, in spite, it goes to the end of requests.
• 6. C-LOOK disk scheduling algorithm:The C-Look algorithm is
almost the same as the Look algorithm. The only difference is
that after reaching the end requests, it reverses the direction
of the head and starts moving to the initial position. But in
moving back, it does not serve any requests.
• Disk Reliability
• What it is:
• The trustworthiness of a storage device to function correctly
and store data without errors.
• Factors affecting it:
• Physical damage, wear and tear, manufacturing defects, and
improper use can all decrease disk reliability.
• Monitoring:
• Operating systems often use technologies like SMART (Self-
Monitoring, Analysis, and Reporting Technology) to monitor a
disk's health and predict potential issues like bad blocks
• Disk Formatting
• What it is:
• The process of preparing a storage device for use, which
involves creating a file system that organizes the disk's
sectors.
• Purpose:
• It sets up the drive so the operating system can read and write
data to it, and it can also clear all existing data from the disk
• Boot-Block
• What it is:
• The very first section of a storage device that holds essential
data and instructions needed to begin the computer's startup
process.
• Function:
• The computer's BIOS reads the boot block into memory,
which then loads the operating system's boot loader and
starts the OS.
• Importance:
• A damaged or corrupt boot block will prevent the computer
from starting up
•