Lianjie Shi
Abstract
Traditional cache replacement policies such as LRU and LFU were often designed with the focus on efficiency and aimed at maximizing the hit rates. However, the resource owners of modern computing systems such as cloud infrastructures and content delivery networks often have new objectives such as fairness and revenue to be optimized rather than the overall hit rate. A general resource management framework that allows resource owners to determine various resource allocations is desirable. Although such a mechanism like Weighted Fair Queueing (WFQ) exists for indivisible time-shared resources such as CPU and network bandwidth, no such counterpart exists for space-shared resources such as cache and main memory.
In this paper, we propose Weighted Fair Caching (WFC), a capacity-driven cache policy that provides explicitly tunable resource allocations for cache owners in terms of the occupancy rates of contents. Through analysis of the continuoustime Markov Chain model of cache dynamics, we derive the closed-form occupancy rates as a function of the weights of contents, and various properties such as monotonicity and scaling of WFC. We show that WFC can be used to provide fair sharing of cache space among contents, as well as class-based service differentiations.
- Buchholz, P., Kriege, J., and Felko, I. Input modeling with phase-type distributions and Markov models: theory and applications. Springer, 2014. Google Scholar
Digital Library
- Coffman, E. G., and Denning, P. J. Operating systems theory, vol. 973. Prentice-Hall Englewood Cli s, NJ, 1973. Google ScholarDigital Library
- Demers, A., Keshav, S., and Shenker, S. Analysis and simulation of a fair queueing algorithm. In ACM SIGCOMM Computer Communication Review (1989), vol. 19, ACM, pp. 1{12. Google ScholarDigital Library
Recommendations
Caching policy design and cache allocation in active reliable multicast
Active reliable multicast (ARM) is a novel loss recovery scheme for large-scale reliable multicast. It uses active routers to perform NACK (negative-acknowledgement) consolidation and scoped retransmission. For optimizing the loss recovery performance ...
FGPC: fine-grained popularity-based caching design for content centric networking
MSWiM '14: Proceedings of the 17th ACM international conference on Modeling, analysis and simulation of wireless and mobile systemsContent Centric Networking (CCN) is a content name-oriented approach to disseminate content to edge gateways/routers. In CCN, a content is cached at routers for a certain time. When the associated deadline is reached, the content is removed to cope with ...
Selective Victim Caching: A Method to Improve the Performance of Direct-Mapped Caches
Although direct-mapped caches suffer from higher miss ratios as compared to set-associative caches, they are attractive for today's high-speed pipelined processors that require very low access times. Victim caching was proposed by Jouppi [1] as an ...
Comments