Research on Caching Mechanism Based on User Community

2014 ◽  
Vol 672-674 ◽  
pp. 2013-2016
Author(s):  
Li Yan ◽  
Yan Sheng Qu
Keyword(s):  
Flow Dynamics ◽  
Cache Replacement ◽  
Test Bed ◽  
Data Caching ◽  
User Community ◽  
Distributed Caching ◽  
Replacement Algorithm ◽  
Caching Scheme ◽  
Simulation And Experiment ◽  
Caching Mechanism

This paper produced a data caching system framework based on two-layer Chord. Caching is shared by users in domain and hot accessing information is shared by inter-domain users. It effectively reduces the caching system’s overhead. We also introduced cache replacement algorithm based on the user community, especially the user’s influence in the community and the information flow dynamics. The result of simulation and experiment of test-bed environment shows the caching scheme based on user community outperforms most existing distributed caching schemes.

An Aggregation Cache Replacement algorithm based on ontology clustering

2006 ◽  
Vol 11 (5) ◽  
pp. 1141-1146
Author(s):  
Zhu Jiang ◽  
Shen Qingguo ◽  
Tang Tang ◽  
Li Yongqiang
Keyword(s):  
Cache Replacement ◽  
Replacement Algorithm

IMPROVING peLIFO CACHE REPLACEMENT POLICY: HARDWARE REDUCTION AND THREAD-AWARE EXTENSION

2014 ◽  
Vol 23 (04) ◽  
pp. 1450046
Author(s):  
ENRIQUE SEDANO ◽  
SILVIO SEPULVEDA ◽  
FERNANDO CASTRO ◽  
DANIEL CHAVER ◽  
RODRIGO GONZALEZ-ALBERQUILLA ◽  
...  
Keyword(s):  
New York ◽  
Replacement Policy ◽  
Cache Replacement ◽  
Dynamic Information ◽  
Processor Performance ◽  
Replacement Algorithm ◽  
L2 Cache ◽  
Cache Efficiency ◽  
Performance Penalty

Studying blocks behavior during their lifetime in cache can provide useful information to reduce the miss rate and therefore improve processor performance. According to this rationale, the peLIFO replacement algorithm [M. Chaudhuri, Proc. Micro'09, New York, 12–16 December, 2009, pp. 401–412], which learns dynamically the number of cache ways required to satisfy short-term reuses preserving the remaining ways for long-term reuses, has been recently proposed. In this paper, we propose several changes to the original peLIFO policy in order to reduce the implementation complexity involved, and we extend the algorithm to a shared-cache environment considering dynamic information about threads behavior to improve cache efficiency. Experimental results confirm that our simplification techniques reduce the required hardware with a negligible performance penalty, while the best of our thread-aware extension proposals reduces average CPI by 8.7% and 15.2% on average compared to the original peLIFO and LRU respectively for a set of 43 multi-programmed workloads on an 8 MB 16-way set associative shared L2 cache.

Sign in / Sign up

Export Citation Format

Share Document