一种基于ABT树的忽略缓存算法  

Research on an Ignorable Cache Algorithm Based on ABT Tree

作　　者：肖瑜[1] 刘宏义[1] 杨明[1] 

机构地区：[1]中国人民解放军边防学院战术教研室,陕西西安710108

出　　处：《电子科技》2013年第9期14-17,共4页Electronic Science and Technology

摘　　要：计算机的性能将会变得越来越依赖于内存访问,而不是单纯的CPU原始性能。实时仿真需要大量的数据集,而内存的瓶颈将成为它的限制,尤其那些不能充分利用多级存储结构的算法,会有更多的缓存缺失。但基于ABT树的忽略缓存算法具有较好的适应性,它为缓存感知算法提供了一个良好的替代方案,且二者的性能基本相同。The computer＇s capability depends more on memory access than on the CPU＇s original ability. Real-time simulation needs many datasets, while the shortage of memory will become the main limitation. More loss of cache will results by those algorithms which cannot take full advantage of multilevel storage structure. The ignorable cache algorithm based on ABT tree has good adaptability, and offers a desirable substitute scheme for the algorithm of cache-awareness. And these two methods have basically the same effect.

关 键 词：忽略缓存算法 ABT树 缓存缺失 VAN Emde Boas布局 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]