Optimization of online disk scheduling algorithms

被引：0

作者：

Computer Science Department, New Jersey Institute of Technology, Newark, NJ 07102, United States ^{[1
]}

机构：

来源：

Perform Eval Rev | 2006年 / 4卷 / 42-46期

关键词：

Computer simulation - Costs - Hard disk storage - Online systems - Optimization;

D O I：

10.1145/1138085.1138086

中图分类号：

学科分类号：

摘要：

Disk scheduling policies have a significant effect on disk performance. SPTF is one of the well-known policies that can increase disk performance near to optimality [1], One of the drawbacks of the regular implementation of SPTF is its high computational cost. The computational cost [of SPTF] (as indicated crudely by our simulation times) is very high [2]. This paper shows that computational cost of SPTF is not the characteristic of SPTF, but it is a matter of implementation. The experience shows that this approach can improve the efficiency over 80% compared to naïve implementation. Finally, an algorithm for efficient implementation of look-ahead algorithms is introduced.

引用