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.

Research on an Efficient and Ignorable Cache Algorithm of ABT Tree

  • 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.
  • loading

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return