FAST 2002 Abstract
Revisiting Caching for Heterogeneous Storage Systems
Brian C. Forney Andrea C. Arpaci-Dusseau Remzi H. Arpaci-Dusseau, Computer Sciences Department,
University of Wisconsin, Madison
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
- View the full text of this paper in
PDF. Until January 2003, you will need your USENIX membership identification in order to access the full papers.
The Proceedings are published as a collective work, © 2002 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
- To become a USENIX Member, please see our Membership Information.