杨明, 刘宏义. 一种高效且忽略缓存的ABT树实现算法研究[J]. 微电子学与计算机, 2013, 30(8): 135-138.
引用本文: 杨明, 刘宏义. 一种高效且忽略缓存的ABT树实现算法研究[J]. 微电子学与计算机, 2013, 30(8): 135-138.
YANG Ming, LIU Hong-yi. Research on an Efficient and Ignorable Cache Algorithm of ABT Tree[J]. Microelectronics & Computer, 2013, 30(8): 135-138.
Citation: YANG Ming, LIU Hong-yi. Research on an Efficient and Ignorable Cache Algorithm of ABT Tree[J]. Microelectronics & Computer, 2013, 30(8): 135-138.

一种高效且忽略缓存的ABT树实现算法研究

Research on an Efficient and Ignorable Cache Algorithm of ABT Tree

  • 摘要: 计算机的性能将会变得越来越依赖于内存访问,而不是单纯的 CPU 原始性能。实时仿真需要大量的数据集,而内存瓶颈会成为它的限制,尤其是那些不能充分利用多级存储结构的算法,会有更多的缓存缺失。但是基于ABT 树的忽略缓存算法具有很好的适应性,它为缓存感知算法提供了一个很好的替代方案,且二者的性能不相上下。

     

    Abstract: The computer's capability depends more memory access than the CPU's original ability. Real-time simulation needs lots of datasets, the shortage of memory will become the main limitation. Especially those algorithm which cannot take advantage of multilevel storage structure will bring much more lose of cache.But the ignorable cache algorithm based on ABT tree has great adaptability,it will offer a wonderful substitute scheme for the algorithm of cache-awareness.What's more,these tow methods have the same effect.

     

/

返回文章
返回