Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

Storage-Aware Caching: Revisiting Caching for Heterogeneous Storage Systems

Modern storage environments are composed of a variety of devices with different performance characteristics. In this paper, we explore storage-aware caching algorithms, in which the file buffer replacement algorithm explicitly accounts for differences in performance across devices. We introduce a new family of storage-aware caching algorithms that partition the cache, with one partition per device. The algorithms set the partition sizes dynamically to balance work across the devices. Through simulation, we show that our storage-aware policies perform similarly to LANDLORD, a cost-aware algorithm previously shown to perform well in Web caching environments. We also demonstrate that partitions can be easily incorporated into the Clock replacement algorithm, thus increasing the likelihood of deploying cost-aware algorithms in modern operating systems.

Brian C. Forney, University of Wisconsin

Andrea C. Arpaci-Dusseau, University of Wisconsin

BibTeX
@inproceedings {270754,
author = {Brian C. Forney and Andrea C. Arpaci-Dusseau},
title = {{Storage-Aware} Caching: Revisiting Caching for Heterogeneous Storage Systems},
booktitle = {Conference on File and Storage Technologies (FAST 02)},
year = {2002},
address = {Monterey, CA},
url = {https://www.usenix.org/conference/fast-02/storage-aware-caching-revisiting-caching-heterogeneous-storage-systems},
publisher = {USENIX Association},
month = jan
}
Download

Links

Paper: 
http://www.usenix.org/publications/library/proceedings/fast02/full_papers/forney/forney.pdf
Paper (HTML): 
http://www.usenix.org/publications/library/proceedings/fast02/full_papers/forney/forney_html/index.html
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us