P2P Cache Management Based on Optimization of Replica, Popularity & Capacity

2009 ◽  
Author(s):  
Fen Wang ◽  
Changsheng Xie ◽  
Yude Wang ◽  
Zhengwu Lu
Keyword(s):  
Cache Management ◽  
P2p Cache

Intelligent download and cache management for interactive non-linear video

2012 ◽  
Vol 70 (2) ◽  
pp. 905-948 ◽  
Author(s):  
Britta Meixner ◽  
Jürgen Hoffmann
Keyword(s):  
Cache Management ◽  
Non Linear

scholarly journals Dynamic cache management in content delivery networks

2021 ◽  
Vol 187 ◽  
pp. 107822
Author(s):  
Srujan Teja Thomdapu ◽  
Palash Katiyar ◽  
Ketan Rajawat
Keyword(s):  
Content Delivery ◽  
Cache Management ◽  
Content Delivery Networks ◽  
Delivery Networks

Hybrid Cache Management in Ad Hoc Networks

2021 ◽  
Author(s):  
C. Gopala Krishnan ◽  
Y. Harold Robinson ◽  
E. Golden Julie ◽  
A. M. Anusha Bamini ◽  
Raghvendra Kumar ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Cache Management ◽  
Hybrid Cache ◽  
Hoc Networks

Penalty- and Locality-aware Memory Allocation in Redis Using Enhanced AET

2021 ◽  
Vol 17 (2) ◽  
pp. 1-45
Author(s):  
Cheng Pan ◽  
Xiaolin Wang ◽  
Yingwei Luo ◽  
Zhenlin Wang
Keyword(s):  
Large Data ◽  
Data Locality ◽  
Memory Allocation ◽  
Cache Management ◽  
Cache Replacement ◽  
Time Model ◽  
Memory Cache ◽  
Management Scheme ◽  
Data Volume ◽  
Replacement Algorithms

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.

scholarly journals QoE-Aware Mobile VR HAS Cache Management With Coding Helper

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 44556-44569 ◽  
Author(s):  
Fei Wang ◽  
Zesong Fei ◽  
Jianchao Zheng ◽  
Jing Wang
Keyword(s):  
Cache Management

Multitiered Cache Management and Acceleration for Database-Driven Websites

2004 ◽  
Vol 12 (3) ◽  
pp. 221-235 ◽  
Author(s):  
Wen-Syan Li ◽  
Wang-Pin Hsiung ◽  
K. Selcuk Candan
Keyword(s):  
Cache Management
Sign in / Sign up

Export Citation Format

Share Document