RUE: A caching method for identifying and managing hot data by leveraging resource utilization efficiency

作     者：Ai, Liang Deng, Yuhui Zhou, Yi Feng, Hao 

作者机构：Jinan Univ Dept Comp Sci Guangzhou 510632 Peoples R China Wuhan Natl Lab Optoelect Wuhan Peoples R China Columbus State Univ TSYS Sch Comp Sci Columbus GA USA 

出 版 物：《SOFTWARE-PRACTICE & EXPERIENCE》 (软件:实践与经验)

年 卷 期：2021年第51卷第11期

页      面：2252-2273页

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：International Cooperation Project of Guangdong Province [2020A0505100040] 

主　　题：cache replacement algorithm caching hot data identification and management resource utilization efficiency reuse distance 

摘      要：In this study, we propose a caching method called RUE for dynamic large-scale data streams. We define a data model to facilitate hot data identification and management. At the heart of RUE model is hot degree that takes into account two factors data resource utilization efficiency and reuse distance, aiming to quantitatively reflect data popularity in a dynamic data stream. Based on data s hot degree, RUE classifies data into four types, each of which is assigned with an associated cache residence time. Guided by RUE model, we develop HM algorithm to identify and manage hot data in a dynamic data stream. HM algorithm is implemented by four stacks, namely, new stack, short stack, long stack, and temp stack. Moreover, an eviction and a migration algorithms are integrated into HM to facilitate block replacement and migration. To evaluate the performance of HM algorithm, we quantitatively compare the performance of RUE with three state-of-art algorithms, namely, LRU, LIRS, and ARC under various replacement policies, operations, and workloads. Experimental results show that RUE outperforms these three existing algorithms in terms of both read and write hit rates. Furthermore, we show that with the four stacks in place, the computing overhead of HM is negligible.