Zone-based shortest positioning time first scheduling for MEMS-based storage devices

Appeared in Proceedings of the 11th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS '03).

Abstract

Access latency to secondary storage devices is frequently a limiting factor in computer system performance. New storage technologies promise to provide greater storage densities at lower latencies than is currently obtainable with hard disk drives. MEMS-based storage devices use orthogonal magnetic or physical recording techniques and thousands of simultaneously active MEMS-based read-write tips to provide high-density low-latency non-volatile storage. These devices promise seek times 10–20 times faster than hard drives, storage densities 10 times greater, and power consumption an order of magnitude lower. Previous research has examined data layout and request ordering algorithms that are analogs of those developed for hard drives. We present an analytical model of MEMS device performance that motivates a computationally simple MEMS-based request scheduling algorithm called ZSPTF, which has average response times comparable to Shortest Posi- tioning Time First (SPTF) but with response time variability comparable to Circular Scan (C-SCAN).

Publication date:
October 2003

Authors:
Bo Hong
Scott A. Brandt
Darrell D. E. Long
Ethan L. Miller
Karen Glocer
Zachary Peterson

Projects:
MEMS-based Storage

Available media

Full paper text: PDF

Bibtex entry

@inproceedings{hong-mascots03,
  author       = {Bo Hong and Scott A. Brandt and Darrell D. E. Long and Ethan L. Miller and Karen Glocer and Zachary Peterson},
  title        = {Zone-based shortest positioning time first scheduling for {MEMS}-based storage devices},
  booktitle    = {Proceedings of the 11th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS '03)},
  pages        = {104-113},
  month        = oct,
  year         = {2003},
}