Major Activities of an Operating System with Regard to Secondary Storage Management

Secondary storage devices are non-volatile devices where data is stored for long-term storage. Disks are the mainly used secondary storage devices, providing the bulk of secondary storage in modern operating systems.

The main activity performed in secondary storage management is disk scheduling. This involves determining the order in which disk I/O requests are serviced to minimize seek time and optimize performance. There are many disk scheduling algorithms, with the most important being FCFS, SSTF, SCAN, and LOOK scheduling.

Disk Scheduling Overview Disk Track (0 to 199) 10 23 50 (Head) 78 80 95 0 199 Request Queue: 10, 95, 23, 78, 80

All the disk scheduling algorithms are explained using the following requests for the disk −

10, 95, 23, 78, 80

First Come First Served (FCFS) Scheduling

In FCFS scheduling, requests are serviced in their arrival order. This algorithm is fair as it allows all requests a chance, but it does not provide the fastest possible service due to potentially large seek times.

FCFS Disk Scheduling 10 ? 23 ? 50 (Start) 78 ? 80 ? 95 ? Service Order: 10 ? 95 ? 23 ? 78 ? 80 Total Head Movement: 40 + 85 + 72 + 55 + 2 = 254 tracks

In the above example, requests are serviced in arrival order: 10, 95, 23, 78, 80. The seek head starts at position 50.

Shortest Seek Time First (SSTF) Scheduling

In SSTF scheduling, the request closest to the current head position is served first. This minimizes seek time but may cause starvation for requests located far from the current head position.

SSTF Disk Scheduling 10 ? 23 ? 50 (Start) 78 ? 80 ? 95 ? Service Order: 23 ? 10 ? 78 ? 80 ? 95 Total Head Movement: 27 + 13 + 68 + 2 + 15 = 125 tracks

In the above example, requests are serviced in order 23, 10, 78, 80, 95. Starting at 50, the algorithm picks 23 (closest), then 10, and continues with the remaining requests.

SCAN Scheduling

In SCAN scheduling (also called the elevator algorithm), the head moves in one direction servicing all requests until it reaches the end of the disk, then reverses direction. This provides more uniform wait times compared to SSTF.

SCAN

Updated on: 2026-03-17T09:01:38+05:30

2K+ Views

Kickstart Your Career

Get certified by completing the course

Get Started
Advertisements