RSDS - Experiences in Building a Rotation-Sensitive Disk Scheduler

Faculty: Tzi-cker Chiueh

Group Members:

Project Description:

  The goal of this research is to answer the following question: since most disks does not have complex disk scheduler such as SATF (shortest access time first), can we implement such an intelligent disk scheduler at software level? The challenges for doing this are the following:

  1. Can we acquire the accurate disk layout information?
  2. Can the disk service time per request be relatively accurate predicted?
  3. Is there a simple linear model to model the disk service time per request?

We did extensive micro-benchmarks on various kinds of modern hard drives. The results convinced us that given the complexity of modern hard drive and current limited hard drive interface, it is impossible to have an accurate linear service time model at software level. More details can be found at our technical report.

Technical Report:

Acknowledgement

This research is supported by an NSF Career Award MIP-9502067, NSF MIP-9710622, NSF IRI-9711635, NSF EIA-9818342, NSF ANI-9814934, a contract 95F138600000 from Community Management Staff's Massive Digital Data System Program, USENIX student research gransts, as well as fundings from Sandia National Laboratory, Reuters Information Technology Inc., and Computer Associates/Cheyenne Inc.