Cache replacement based on reuse-distance prediction

2007 ◽  
Author(s):  
Georgios Keramidas ◽  
Pavlos Petoumenos ◽  
Stefanos Kaxiras
Keyword(s):  
Cache Replacement ◽  
Reuse Distance ◽  
Distance Prediction

scholarly journals Reuse Distance-Based Probabilistic Cache Replacement

2016 ◽  
Vol 12 (4) ◽  
pp. 1-22 ◽  
Author(s):  
Subhasis Das ◽  
Tor M. Aamodt ◽  
William J. Dally
Keyword(s):  
Cache Replacement ◽  
Reuse Distance

Web Cache Replacement with the Repairable LRU Algorithm

2015 ◽  
Vol 10 (6) ◽  
pp. 620 ◽  
Author(s):  
Prapai Sridama ◽  
Somchai Prakancharoen ◽  
Nalinpat Porrawatpreyakorn
Keyword(s):  
Cache Replacement ◽  
Web Cache

TNDP: Tensor-based Network Distance Prediction with Confidence Intervals

2021 ◽  
pp. 1-1
Author(s):  
Haojun Huang ◽  
Li Li ◽  
Geyong Min ◽  
Wang Miao ◽  
Yingying Zhu ◽  
...  
Keyword(s):  
Confidence Intervals ◽  
Network Distance ◽  
Distance Prediction

Enabling Service Cache in Edge Clouds

2021 ◽  
Vol 2 (3) ◽  
pp. 1-24
Author(s):  
Chih-Kai Huang ◽  
Shan-Hsiang Shen
Keyword(s):  
Virtual Machines ◽  
Replacement Policy ◽  
Cache Replacement ◽  
Cache Replacement Policy ◽  
Average Latency ◽  
Hit Rates ◽  
Iot Devices ◽  
Multi Access ◽  
Computational Resources ◽  
The Cost

The next-generation 5G cellular networks are designed to support the internet of things (IoT) networks; network components and services are virtualized and run either in virtual machines (VMs) or containers. Moreover, edge clouds (which are closer to end users) are leveraged to reduce end-to-end latency especially for some IoT applications, which require short response time. However, the computational resources are limited in edge clouds. To minimize overall service latency, it is crucial to determine carefully which services should be provided in edge clouds and serve more mobile or IoT devices locally. In this article, we propose a novel service cache framework called S-Cache , which automatically caches popular services in edge clouds. In addition, we design a new cache replacement policy to maximize the cache hit rates. Our evaluations use real log files from Google to form two datasets to evaluate the performance. The proposed cache replacement policy is compared with other policies such as greedy-dual-size-frequency (GDSF) and least-frequently-used (LFU). The experimental results show that the cache hit rates are improved by 39% on average, and the average latency of our cache replacement policy decreases 41% and 38% on average in these two datasets. This indicates that our approach is superior to other existing cache policies and is more suitable in multi-access edge computing environments. In the implementation, S-Cache relies on OpenStack to clone services to edge clouds and direct the network traffic. We also evaluate the cost of cloning the service to an edge cloud. The cloning cost of various real applications is studied by experiments under the presented framework and different environments.

Sign in / Sign up

Export Citation Format

Share Document