ACM Home Page
Please provide us with feedback. Feedback
Optimization of online disk scheduling algorithms
Full text PdfPdf (711 KB)
Source ACM SIGMETRICS Performance Evaluation Review archive
Volume 33 ,  Issue 4  (March 2006) table of contents
Design, implementation, and performance of storage systems
Pages: 42 - 46  
Year of Publication: 2006
ISSN:0163-5999
Authors
Saman Zarandioon  New Jersey Institute of Technology, Newark, NJ
Alexander Thomasian  New Jersey Institute of Technology, Newark, NJ
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 42,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1138085.1138086
What is a DOI?

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 lookahead algorithms is introduced.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
G. Gallo, F. Malucelli, and M. Marre. "Hamiltonian Paths Algorithms For Disk Scheduling", Technical Report 20/94, Dipartimento di Informatica, Universita di Pisa, 1994
2
 
3
D. M. Jacobson and J. Wilkes. "Disk scheduling algorithms based on rotational position", Technical Report HPLCSP-91-7, HP Labs, 1991.
 
4
M. Andrews, M. A. Bender, and L. Zhang. "New Algorithms for the Disk Scheduling Problem." Algorithmica, 32(2): 277--301, 2002
5

Collaborative Colleagues:
Saman Zarandioon: colleagues
Alexander Thomasian: colleagues