动态数据处理平台分布式缓存替换算法仿真

Simulation of Distributed Cache Replacement Algorithms for Dynamic Data Processing Platform

针对传统分布式缓存替换算法路由器命中缓存性能不足的问题,提出一种动态数据处理平台分布式缓存替换算法。描述动态数据处理平台分布式数据缓存信息,构建动态数据处理平台的缓存架构表,并根据缓存情况替换缓存架构表,通过不断替换的缓存架构表改进权重替换算法,在算法中添加缓存对象这一参数,并通过改进后的算法计算缓存对象的更新权重值及其权重成本,根据计算成本替换LRU链表中的尾指针元素,当元素已存在缓存中并且被命中时、或出现被请求的新元素时,则更新LRU链,构造新的LRU链表,通过重构的LRU链表构建分布式缓存替换策略,从而实现动态数据处理平台分布式缓存替换算法的构建。为了证明动态数据处理平台分布式缓存替换算法的优越性,将其与传统分布式缓存替换算法进行比较,实验结果证明,上述算法的路由器命中缓存性能优于传统算法,更适合进行动态数据处理平台的分布式缓存替换。

This article presents a distributed cache replacement algorithm for dynamic data processing platform.Firstly,this research described the distributed data cache information of dynamic data processing platform and constructed the cache architecture table of dynamic data processing platform.Meanwhile,the cache architecture table was replaced according to the cache situation.Based on cache architecture table which was constantly replaced,the weight replacement algorithm was improved.In addition,the cache object was added to the algorithm,and thus the updated weight value of cache object and its weight cost were calculated through the improved algorithm.According to the computing cost,the tail pointer element in LRU linked list was replaced.When the element had already existed in the cache and it was hit,or a new element was requested,LRU chain was updated and a new LRU chain list was established.Moreover,the distributed cache replacement strategy was constructed by reconstructing LRU linked list,and thus the distributed cache replacement algorithm for dynamic data processing platform was constructed.Simulation results show that the performance of cache hit of router in the proposed algorithm is better than that of traditional algorithm,so it is more suitable for the distributed cache replacement of dynamic data processing platform.