Analysis of methods for scheduling low priority disk drive tasks

Eitan Bachmat, Jiri Schindler

Research output: Contribution to journalConference articlepeer-review

35 Scopus citations


This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived closed form solution is applicable to class of greedy algorithms that include a variety of background disk scanning applications. By paying close attention to many characteristics of modern disk drives, the analytical solutions achieve very high accuracy - the difference between the predicted response times and the measurements on two different disks is only 3% for all but one examined workload. This paper also proves a theorem which shows that background tasks implemented by greedy algorithms can be accomplished with very little seek penalty. Using greedy algorithms gives a 10% shorter response time for the foreground application requests and up to a 20% decrease in total background task run time compared to results from previously published techniques.

Original languageEnglish
Pages (from-to)55-65
Number of pages11
JournalPerformance Evaluation Review
Issue number1
StatePublished - 1 Jan 2002
EventACM SIGMETRICS 2002 International Conference on Measurement and Modeling of Computer Systems - Marina Del Rey, CA, United States
Duration: 15 Jun 200219 Jun 2002

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Analysis of methods for scheduling low priority disk drive tasks'. Together they form a unique fingerprint.

Cite this