Cost-aware caching algorithms for distributed storage servers

Authors:
Shuang Liang;Ke Chen;Song Jiang;Xiaodong Zhang
Affiliations:
The Ohio State University, Columbus, OH;University of Illinois, Urbana, IL;Wayne State University, Detroit, MI;The Ohio State University, Columbus, OH
Venue:
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Year:
2007

Citing 9
Cited 2

New results on server problems

SIAM Journal on Discrete Mathematics
An efficient implementation of a scaling minimum-cost flow algorithm

Journal of Algorithms
On-line file caching

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Introduction to algorithms

Introduction to algorithms
Computer Architecture; A Quantitative Approach

Computer Architecture; A Quantitative Approach
Storage-Aware Caching: Revisiting Caching for Heterogeneous Storage Systems

FAST '02 Proceedings of the Conference on File and Storage Technologies
Making LRU Friendly to Weak Locality Workloads: A Novel Replacement Algorithm to Improve Buffer Cache Performance

IEEE Transactions on Computers
Cost-aware WWW proxy caching algorithms

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
A study of replacement algorithms for a virtual-storage computer

IBM Systems Journal

A Cost-Aware Strategy for Query Result Caching in Web Search Engines

ECIR '09 Proceedings of the 31th European Conference on IR Research on Advances in Information Retrieval
Cost-Aware Strategies for Query Result Caching in Web Search Engines

ACM Transactions on the Web (TWEB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a system, we show that the total cost of any replacement algorithm is bounded by the total costs of evicted blocks plus the total cost of the optimal off-line algorithm (OPT). We propose two off-line heuristics: MIN-d and MIN-cod, as well as an on-line algorithm: HD-cod, which can be run efficiently and perform well at the same time. Our simulation results with Storage Performance Council (SPC)'s storage server traces show that: (1) for off-line workloads, MIN-cod performs as well as OPT in some cases, all is atmost three times worse in all test case; (2) for on-line workloads, HD-cod performs closely to the best algorithms in all cases, and is the single algorithm that performs well in all test cases, including the optimal on-line algorithm (Landlord). Our study suggests that the essential issue to be considered be the trade-off between the costs of victim blocks and the total number of evictions in order to effectively optimize both efficiency and performance of distributed storage cache replacement algorithms.