Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Mattson, J. Gecsei, D. Slutz, I. Traiger (1970)
Evaluation Techniques for Storage HierarchiesIBM Syst. J., 9
(2015)
Optimal cache partitionsharing
From web
Approximated LRURetrieved on 15 March, 2020from https://redis.io/topics/lru-cache., 15
Xiao Zhang, S. Dwarkadas, Kai Shen (2009)
Towards practical page coloring-based multicore cache management
Myungkeun Yoon, JinWoo Son, Seon-Ho Shin (2014)
Bloom tree: A search tree based on Bloom filters for multiple-set membership testingIEEE INFOCOM 2014 - IEEE Conference on Computer Communications
Carl Waldspurger, Nohhyun Park, Alex Garthwaite, I. Ahmad (2015)
Efficient MRC Construction with SHARDS
(2020)
Redis as an LRU cache
Yul-Heon Kim, M. Hill, D. Wood (1991)
Implementing stack simulation for highly-associative memories
Berk Atikoglu, Yuehai Xu, E. Frachtenberg, Song Jiang, Mike Paleczny (2012)
Workload analysis of a large-scale key-value store
B. Bloom (1970)
Space/time trade-offs in hash coding with allowable errorsCommun. ACM, 13
P. Cao, S. Irani (1997)
Cost-Aware WWW Proxy Caching Algorithms
Nirav Atre, Justine Sherry, Weina Wang, Daniel Berger (2020)
Caching with Delayed HitsProceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication
Hjörtur Björnsson, G. Chockler, T. Saemundsson, Ymir Vigfusson (2013)
Dynamic performance profiling of cloud cachesProceedings of the 4th annual Symposium on Cloud Computing
From web
Memtier_benchmarkRetrieved on 15 March, 2020 from https://github.com/GarantiaData/memtier_benchmark., 15
Pin Zhou, V. Pandey, Jagadeesan Sundaresan, Anand Raghuraman, Yuanyuan Zhou, Sanjeev Kumar (2004)
Dynamic tracking of page miss ratio curve for memory management
J. Shim, P. Scheuermann, R. Vingralek (1999)
Proxy cache algorithms: Design, implementation, and performanceKnowl. Data Eng. IEEE Trans., 11
Paulo Almeida, Carlos Baquero, Nuno Preguiça, D. Hutchison (2007)
Scalable Bloom FiltersInf. Process. Lett., 101
Zhuohan Xie, Wencheng Ding, Hongya Wang, Yingyuan Xiao, Zhenyu Liu (2017)
D-Ary Cuckoo Filter: A Space Efficient Data Structure for Set Membership Lookup2017 IEEE 23rd International Conference on Parallel and Distributed Systems (ICPADS)
Yang Wang, J. Shu, Guangyan Zhang, Wei Xue, Weimin Zheng (2010)
SOPA: Selecting the optimal caching policy adaptivelyACM Trans. Storage, 6
Xiameng Hu, Xiaolin Wang, Lan Zhou, Yingwei Luo, C. Ding, Song Jiang, Zhenlin Wang (2017)
Optimizing Locality-Aware Memory Management of Key-Value CachesIEEE Transactions on Computers, 66
Xiameng Hu, Xiaolin Wang, Yechen Li, Lan Zhou, Yingwei Luo, C. Ding, Song Jiang, Zhenlin Wang (2015)
LAMA: Optimized Locality-aware Memory Allocation for Key-value Cache
Yahoo! Cloud Serving Benchmark (YCSB)
Asaf Cidon, D. Rushton, Stephen Rumble, Ryan Stutsman (2017)
Memshare: a Dynamic Multi-tenant Key-value Cache
Cheng Pan, Xiameng Hu, Lan Zhou, Yingwei Luo, Xiaolin Wang, Zhenlin Wang (2018)
PACE: Penalty Aware Cache Modeling with Enhanced AETProceedings of the 9th Asia-Pacific Workshop on Systems
Chencheng Ye, Jacob Brock, C. Ding, Hai Jin (2017)
Rochester Elastic Cache Utility (RECU): Unequal Cache Sharing is Good EconomicsInternational Journal of Parallel Programming, 45
N. Young (1992)
Competitive paging and dual-guided on-line weighted caching and watching algorithms
From web
MurmurHashRetrieved on 15 March, 2020 from https://en.wikipedia.org/wiki/Murmur-Hash., 15
From web
Redis WebsiteRetrieved on 15 March, 2020 from https://redis.io., 15
Xiameng Hu, Xiaolin Wang, Lan Zhou, Yingwei Luo, C. Ding, Zhenlin Wang (2016)
Kinetic Modeling of Data Eviction in Cache
F. Hao, M. Kodialam, T. Lakshman, Haoyu Song (2012)
Fast Dynamic Multiple-Set Membership Testing Using Combinatorial Bloom FiltersIEEE/ACM Transactions on Networking, 20
Daniel Byrne, Nilufer Onder, Zhenlin Wang (2018)
mPart: miss-ratio curve guided partitioning in key-value storesProceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management
Xiameng Hu, Xiaolin Wang, Lan Zhou, Yingwei Luo, Zhenlin Wang, C. Ding, Chencheng Ye (2018)
Fast Miss Ratio Curve Modeling for Storage CacheACM Transactions on Storage (TOS), 14
Asaf Cidon, Assaf Eisenman, Mohammad Alizadeh, S. Katti (2015)
Dynacache: Dynamic Cloud Caching
Daniel Berger, Benjamin Berg, T. Zhu, S. Sen, Mor Harchol-Balter (2018)
RobinHood: Tail Latency Aware Caching - Dynamic Reallocation from Cache-Rich to Cache-Poor
From web
Memcached WebsiteRetrieved on 15 March, 2020 from http://memcached.org., 15
Calin Cascaval, E. Duesterwald, P. Sweeney, R. Wisniewski (2005)
Multiple page size modeling and optimization14th International Conference on Parallel Architectures and Compilation Techniques (PACT'05)
Daniel Berger, R. Sitaraman, Mor Harchol-Balter (2017)
AdaptSize: Orchestrating the Hot Object Memory Cache in a Content Delivery Network
Aditya Sundarrajan, M. Feng, Mangesh Kasbekar, R. Sitaraman (2017)
Footprint Descriptors: Theory and Practice of Cache Provisioning in a Global CDNProceedings of the 13th International Conference on emerging Networking EXperiments and Technologies
Haipeng Dai, Yuankun Zhong, A. Liu, Wen Wang, M. Li (2016)
Noisy Bloom Filters for Multi-Set Membership TestingProceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science
Aaron Blankstein, S. Sen, M. Freedman (2017)
Hyperbolic Caching: Flexible Caching for Web Applications
From web
Zipfian's LawRetrieved on 15 March, 2020 from https://en.wikipedia.org/wiki/Zipf%27s_law., 15
Q. Niu, James Dinan, Q. Lu, P. Sadayappan (2012)
PARDA: A Fast Parallel Reuse Distance Analysis Algorithm2012 IEEE 26th International Parallel and Distributed Processing Symposium
From web
Memcached Memory Management BlogRetrieved on 15 March, 2020 from https://www.loginradius.com/engineering/memcach-memory-management., 15
Junho Shim, P. Scheuermann, Radek Vingralek (1999)
Proxy Cache Algorithms: Design, Implementation, and PerformanceIEEE Trans. Knowl. Data Eng., 11
From web
MySQL WebsiteRetrieved on 15 March, 2020 from https://www.mysql.com., 15
Nathan Beckmann, Daniel Sánchez (2015)
Talus: A simple way to remove cliffs in cache performance2015 IEEE 21st International Symposium on High Performance Computer Architecture (HPCA)
Carl Waldspurger, T. Saemundsson, I. Ahmad, Nohhyun Park (2017)
Cache Modeling and Optimization using Miniature Simulations
G. Edward Suh, Srinivas Devadas, Larry Rudolph (2001)
Analytical cache models with applications to cache partitioningProceedings of the 15th International Conference on Supercomputing (ICS’01)
Retrieved on 15 March
From web
MySQLslapRetrieved on 15 March, 2020 from https://tosbourn.com/mysqlslap-a-quickstart-guide/., 15
Conglong Li, A. Cox (2015)
GD-Wheel: a cost-aware replacement policy for key-value storesProceedings of the Tenth European Conference on Computer Systems
From web
IEEE Standard for Floating-Point Arithmetic (IEEE 754)Retrieved on 15 March, 2020 from https://en.wikipedia.org/wiki/IEEE_754., 15
Jianqiang Ou, Marc Patton, M. Moore, Yuehai Xu, Song Jiang (2015)
A Penalty Aware Memory Allocation Scheme for Key-Value Cache2015 44th International Conference on Parallel Processing
G. Suh, S. Devadas, L. Rudolph (2000)
Adaptive reduction parallelization techniques
From web
PostgreSQL WebsiteRetrieved on 15 March, 2020 from https://www.postgresql.org/., 15
Jake Wires, S. Ingram, Zachary Drudi, Nicholas Harvey, A. Warfield (2014)
Characterizing Storage Workloads with Counter Stacks
R. Pagh, G. Segev, Udi Wieder (2013)
How to Approximate a Set without Knowing Its Size in Advance2013 IEEE 54th Annual Symposium on Foundations of Computer Science
From web
MSR Cambridge TracesRetrieved on 15 March, 2020 from http://iotta.snia.org/traces/388., 15
Asaf Cidon, Assaf Eisenman, Mohammad Alizadeh, S. Katti (2016)
Cliffhanger: Scaling Performance Cliffs in Web Memory Caches
Due to large data volume and low latency requirements of modern web services, the use of an in-memory key-value (KV) cache often becomes an inevitable choice (e.g., Redis and Memcached). The in-memory cache holds hot data, reduces request latency, and alleviates the load on background databases. Inheriting from the traditional hardware cache design, many existing KV cache systems still use recency-based cache replacement algorithms, e.g., least recently used or its approximations. However, the diversity of miss penalty distinguishes a KV cache from a hardware cache. Inadequate consideration of penalty can substantially compromise space utilization and request service time. KV accesses also demonstrate locality, which needs to be coordinated with miss penalty to guide cache management. In this article, we first discuss how to enhance the existing cache model, the Average Eviction Time model, so that it can adapt to modeling a KV cache. After that, we apply the model to Redis and propose pRedis, Penalty- and Locality-aware Memory Allocation in Redis, which synthesizes data locality and miss penalty, in a quantitative manner, to guide memory allocation and replacement in Redis. At the same time, we also explore the diurnal behavior of a KV store and exploit long-term reuse. We replace the original passive eviction mechanism with an automatic dump/load mechanism, to smooth the transition between access peaks and valleys. Our evaluation shows that pRedis effectively reduces the average and tail access latency with minimal time and space overhead. For both real-world and synthetic workloads, our approach delivers an average of 14.0%∼52.3% latency reduction over a state-of-the-art penalty-aware cache management scheme, Hyperbolic Caching (HC), and shows more quantitative predictability of performance. Moreover, we can obtain even lower average latency (1.1%∼5.5%) when dynamically switching policies between pRedis and HC.
ACM Transactions on Storage (TOS) – Association for Computing Machinery
Published: May 28, 2021
Keywords: Penalty- and locality-aware
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.