Difference between Seek Time and Rotational Latency in Disk Scheduling
Last Updated :
19 Sep, 2024
Disk management is essential for data storage, retrieval of data and backup the data. To store the data in the disk some I/O operations like read/write are needed. The operating system uses disk scheduling techniques which can be used to schedule I/O requests arriving to the disk. This disk scheduling techniques uses some measurements to improve the performance of read or write operations on the disk. They are disk access time, disk response time, seek time, rotational latency and transfer time. This article discusses about Seek Time and Rotational Latency and its difference.
What is Seek Time?
A disk is divided into many circular tracks. Seek Time is defined as the time required by the read/write head to move from one track to another. The formula for calculating seek time is
Seek Time = (Time to cross 1 cylinder(track))*(No of cylinder(track) crossed).
Example: Consider the following diagram, the read/write head is currently on track 1.
Now, on the next read/write request, we may want to read data from Track 4, in this case, our read/write head will move to track 4. The time it will take to reach track 4 is the seek time.
What is Rotational Latency?
The disk is divided into many circular tracks, and these tracks are further divided into blocks knows as sectors. The time required by the read/write head to rotate to the requested sector from the current position is called Rotational Latency. The formula for calculating rotational latency is
Rotational Latency = (Angle between current position and the required sector) / (Rotational frequency).
Example: Consider the following diagram, We have divided each track into 4 sectors. The systems get a request to read a sector from track 1, thus the read/write head will move to track 1 and this time will be seek time. The read/write head is currently in sector 3.
But the data may not be in sector 3. The data block may be present in sector 1. The time required by read/write head to move from sector 3 to sector 1 is the rotational latency. Below is the final configuration.
Advantage of Seek Time and Rotational Latency
- These are essential measurements for choosing the best disk scheduling techniques.
- When both the seek time and rotational latency are reduced that would lead to fast retrieval of data
Difference between Seek Time and Rotational Latency
| Seek Time | Rotational Latency |
|---|
| It is the time required by read/write head to move from one track to other. | It is the time required by read/write head to move from one sector to other. |
| Most disk scheduling only use seek time. | Most disk scheduling do not consider rotational frequency because in most modern system, the actual physical location of blocks in not available. |
| It can be reduced if subsequent request belongs to same track or near. | It can be reduced if subsequent request belongs to adjacent sector. |
| Seek Time = (Time to cross 1 cylinder(track))*(No of cylinder(track) crossed). | Rotational Latency = (Angle between current position and the required sector) / (Rotational frequency). |
Conclusion
The Seek Time and the Rotational Latency are the measurements of time which are needed for read/write operations performed on the disk. Both seek time and rotational latency are reduced that would lead to fast retrieval of data. These are essential for choosing the best disk scheduling techniques but seek time is calculated by moving head from one track to another, whereas rotational latency is calculated by moving head from one sector to another.
Similar Reads
Difference between Rotational Latency and Transfer Time in Disk Scheduling 1. Rotational Latency: Rotational Latency is the amount of time it takes for the desired sector of a to rotate under the read-write heads of the disk drive. In other words, the disk is divided into many circular tracks, and these tracks are further divided into blocks knows as sectors. So Rotational
2 min read
Difference between Rotational Latency and Disk Access Time in Disk Scheduling When a computer reads or writes data on a hard disk, it takes a little time to find and access that data. This delay is caused by two main factors: rotational latency and disk access time. Rotational latency is the time it takes for the disk to spin and bring the required part of the disk under the
4 min read
Difference between Seek Time and Disk Access Time in Disk Scheduling Seek Time: A disk is divided into many circular tracks. Seek Time is defined as the time required by the read/write head to move from one track to another. Example, Consider the following diagram, the read/write head is currently on track 1. Now, on the next read/write request, we may want to read d
3 min read
Difference between Transfer Time and Disk Access Time in Disk Scheduling 1. Transfer Time : Time required to transfer the required amount of data. It can be calculated by the given formula Transfer time, = Data to be transfer / transfer rate Data to be transfer is given in the question and transfer rate is sometimes given and sometimes it may not be given. It can be calc
2 min read
Difference between SSTF and LOOK disk scheduling algorithm Disk scheduling algorithms are used by operating systems to decide the order in which disk I/O requests are processed. Since disk access time is relatively slow, these algorithms aim to reduce the time it takes to read/write data by optimizing the movement of the disk arm.SSTF(Shortest Seek Time Fir
3 min read
Difference Between C-SCAN and SSTF Disk Scheduling Algorithm In C-SCAN Algorithm it is necessary to take into account the direction, i.e., larger or smaller value. This algorithm serves disk requests by moving towards their conclusion while SSTF is a secondary storage scheduling method that decides how the disk's head and arm will move to fulfil read and writ
5 min read