research-article

Weighted Fair Caching: Occupancy-Centric Allocation for Space-Shared Resources

Authors:

Lianjie Shi,

Xin Wang,

Richard T. B. Ma,

Y. C. TayAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 46, Issue 3

Pages 35 - 36

https://doi.org/10.1145/3308897.3308913

Published: 25 January 2019 Publication History

Get Access

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.

References

[1]

Buchholz, P., Kriege, J., and Felko, I. Input modeling with phase-type distributions and Markov models: theory and applications. Springer, 2014.

Digital Library

Google Scholar

[2]

Coffman, E. G., and Denning, P. J. Operating systems theory, vol. 973. Prentice-Hall Englewood Cli s, NJ, 1973.

Digital Library

Google Scholar

[3]

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.

Digital Library

Google Scholar

Cited By

View all

Varalakshmi KAzad S(2023)A Study on Reinforced Support Vector Machine Classifier for Periodic and Aperiodic Scheduling in Networked Control Systems2023 International Conference on Smart Systems for applications in Electrical Sciences (ICSSES)10.1109/ICSSES58299.2023.10201140(1-4)Online publication date: 7-Jul-2023
https://doi.org/10.1109/ICSSES58299.2023.10201140
Menasché DShifrin MHargreaves E(2020)Caches and Timelines Operate Under Heavy TrafficACM SIGMETRICS Performance Evaluation Review10.1145/3439602.343961248:2(24-26)Online publication date: 25-Nov-2020
https://dl.acm.org/doi/10.1145/3439602.3439612

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 systems

Content 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

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 46, Issue 3

December 2018

174 pages

ISSN:0163-5999

DOI:10.1145/3308897

Editor:
Nidhi Hegde
Borealis AI

Issue’s Table of Contents

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 January 2019

Published in SIGMETRICS Volume 46, Issue 3

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
83
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

View all

Varalakshmi KAzad S(2023)A Study on Reinforced Support Vector Machine Classifier for Periodic and Aperiodic Scheduling in Networked Control Systems2023 International Conference on Smart Systems for applications in Electrical Sciences (ICSSES)10.1109/ICSSES58299.2023.10201140(1-4)Online publication date: 7-Jul-2023
https://doi.org/10.1109/ICSSES58299.2023.10201140
Menasché DShifrin MHargreaves E(2020)Caches and Timelines Operate Under Heavy TrafficACM SIGMETRICS Performance Evaluation Review10.1145/3439602.343961248:2(24-26)Online publication date: 25-Nov-2020
https://dl.acm.org/doi/10.1145/3439602.3439612

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Caching policy design and cache allocation in active reliable multicast

FGPC: fine-grained popularity-based caching design for content centric networking

Selective Victim Caching: A Method to Improve the Performance of Direct-Mapped Caches

Comments

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Recommendations

Caching policy design and cache allocation in active reliable multicast

FGPC: fine-grained popularity-based caching design for content centric networking

Selective Victim Caching: A Method to Improve the Performance of Direct-Mapped Caches

Comments

Information

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations