Disk scheduling, priority scheduling algorithm with the shortest seek time and scanning algorithms. 磁盘调度算法,有最短寻道时间优先调度算法和扫描算法。
Therefore, seek time continues to be the largest source of latency in HDDs. 因此,寻道时间一直是HDD的延迟时间的最主要来源。
The time it takes to complete an I / O request ( referred to as disk latency ) is a combination of seek time, rotational latency, and disk transfer time. 而完成一次I/O请求(称为磁盘延迟时间)所需要的时间是寻道时间、旋转延迟时间和磁盘传输时间之和。
Because EFDs have no moving parts, they are not constrained by seek time or rotational latency in the way that FC and SATA HDDs are. 因为EFD没有移动的部件,所以它们不会像FC和SATAHDD那样受到寻道时间或旋转延迟时间的约束。
To improve the efficiency of disk scheduling, this paper proposed an optimization algorithm of disk scheduling based on the Average Seek Time(ST) ( AST ). 针对如何提高磁盘调度效率的问题,提出了一种基于平均寻道时间(AST)的磁盘调度优化算法。