Skip to main content
Article thumbnail
Location of Repository

Scheduling Algorithms for Modern Disk Drives

By Bruce L. \vorthington, Gregory R. Ganger and Yale N. Patt

Abstract

Department of Electrical Engineering and Computer Science Disk subsystem performance can be dramatically im-proved by dynamically ordering, or scheduling, pending re-quests. Via strongly validated simulation, we examine the impact of complex logic & to-physicaJ mappings and large prefetching caches on scheduling effectiveness. Using both synthetic workloads and traces captured from six differ-ent user environments, we arrive at three main conclusions: (I) Incorporating complex mapping information into the scheduler provides only a marginal (less than 2YO) decrease in response times for seek-reducing algorithms. (2) Algorithms which effectively utilize prefetching disk caches provide sig-nificant performance improvements for workloads with read sequentiality. The cyclical scan algorithm (C-LOOK), which always schedules requests inascending logical order, achieves the highest performance among seek-reducing algorithms for such workloads. (3) Algorithms that reduce overall position-ing delays produce the highest performance provided that they recognize and exploit a prefetching cache.

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.1951
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cse.ucsc.edu/~sbran... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.