Optimization of online disk scheduling algorithms

Document Type

Article

Publication Date

3-1-2006

Abstract

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.

Identifier

33744972134 (Scopus)

Publication Title

Performance Evaluation Review

External Full Text Location

https://doi.org/10.1145/1138085.1138086

e-ISSN

01635999

ISSN

01635999

First Page

42

Last Page

46

Issue

4

Volume

33

This document is currently not available here.

Share

COinS