Operating System Tutorial

What is Operating System Evolution of Operating System Types of Operating System Functions of Operating System What is Kernel and Types of Kernel Operating System Properties Operating System Services Components of Operating System Needs of the Operating System Linux Operating System Unix Operating System Ubuntu Operating System What is DOS Operating System Difference Between Multi-programming and Multitasking What is Thread and Types of Thread Process Management Process State What is Process Scheduler and Process Queue What is Context Switching What is CPU Scheduling Scheduling Algorithm FCFS (First-come-First-Serve) Scheduling SJF (Shortest Job First) Scheduling Round-Robin CPU Scheduling Priority Based Scheduling HRRN (Highest Response Ratio Next) Scheduling Process Synchronization Lock Variable Mechanism TSL Mechanism Turn Variable Mechanism Interested Variable Mechanism What is Producer-Consumer Problem What is Semaphore in Operating System Monitors in Operating System What is Deadlock Deadlock Avoidance Strategies for Handling Deadlock Deadlock Prevention Deadlock Detection and Recovery Resource Allocation Graph Banker’s Algorithm in Operating System Fixed Partitioning and Dynamic Partitioning Partitioning Algorithms What is Paging and Segmentation What is Demand Paging What is Virtual Memory Disk Scheduling Algorithms FCFS and SSTF Disk Scheduling Algorithm SCAN and C-SCAN Disk Scheduling Algorithm Look and C-Look Disk Scheduling Algorithm File in Operating System File Access Methods in Operating System File Allocation Method Directory Structure in Operating System Difference between C-LOOK and C-SCAN Difference between Rotational Latency and Disk Assess Time Trap vs Interrupt How to implement Monitors using Semaphores N-Step-SCAN Disk Scheduling Why is it critical for the Scheduler to distinguish between I/O-bound and CPU-bound programs Difference between C-SCAN and SSTF Difference between SCAN and FCFS Difference between Seek Time and Disk Access Time Difference between SSTF and LOOK

Disk Scheduling Algorithms

Disk Scheduling Algorithms

Disk scheduling algorithms are the algorithms that are used for scheduling a disk. Generally, the scheduling refers to a time-table for completing any task or a job. With the help of the operating system, disk scheduling is performed. We use disk scheduling to schedule the Input/output requests that arrive for the disk.  

In other words, we can define disk scheduling as a method that is used by the OS (operating system) to schedule the next upcoming requests. Disk Scheduling is also called Input/output scheduling.

Disk scheduling is important because of the following reasons:

  1. The slowest part of the computer system is the hard drive. So, to access the hard drive conveniently or effectively, we need disk scheduling.
  2. There may be chances that two or more requests can be distant from each other. Therefore, more disk arm movement can happen. Thus, we need disk scheduling for such handling case
  3. Sometimes, there are various I/O requests which arrive from the different processes. But at a time, the disk controller can only serve one I/O request. So, in this way, the other requests have to wait in the waiting queue, and scheduling is needed for those processes that are waiting in the waiting queue.

Objective of Disk Scheduling Algorithm

The objectives of the disk scheduling algorithm are:

  1. Less traveling head time.
  2. Fairness.
  3. Throughput must be high.

Purpose of Disk Scheduling

The purpose of disk scheduling is to choose a disk request from the input/output requests queue and then scheduling the remaining request means which has to be processed

Basic Terms

There are various types of disk scheduling algorithms, but before discussing them, we need to know various essentials terms which are given below:

  1. Seek Time: - Seek time is defined as the time which is used to find the disk arm to a stated track where the data must be read and write. The better disk algorithm is one that gives less average seek time.
  2. Transfer Time: - Transfer time is defined as the time which is used for data transfer. Transfer time depends on two things:
  3. Bytes which we have to transfer

2) The rotation speed of the disk.

  •  Rotational Latency: - Rotational latency means the time which is needed to rotate the desired sector into a position so that a read/write heads can be accessed. The better disk scheduling algorithm is that which takes less rotational latency.
  • Disk Access Time: - We can define disk access time as:
Disk Scheduling Algorithms
  • Disk Response Time: - Disk response time is defined as the average time, which is used by an individual request, waiting for input/output operations. The best scheduling algorithm is one that gives less variance response.

Disk Scheduling Algorithms

There are different types of disk scheduling algorithms. Each algorithm contains its own benefits and drawbacks.

  1. FCFS (first-come-first-serve) disk scheduling algorithm
  2. SSTF (shortest seek time first) disk scheduling algorithm
  3. SCAN disk scheduling algorithm
  4. C-SCAN disk scheduling algorithm
  5. LOOK disk scheduling algorithm
  6. C-LOOK disk scheduling algorithm.