A High-Performance Sequential MRU Cache Using Valid-Bit Assistant Search Algorithm

Most recently used (MRU) cache is one of the set-associative caches that emphasize implementation of associativity higher than 2. However, the access time is increased because the MRU information must be fetched before accessing the sequential MRU (SMRU) cache. In this paper, focusing on the SMRU cache with subblock placement, we propose an MRU cache scheme that separates the valid bits from data memory and uses these valid bits to decide to reduce the unnecessary access number of memory banks. By this approach, the probability of the front hits is thus increased, and it significantly helps in improving the average access time of the SMRU cache without valid-bit assistant search especially for large associativity and small subblock size.

[1]  A. Argawal,et al.  Cache performance of operating systems and multiprogramming , 1988 .

[2]  Anant Agarwal,et al.  Column-associative caches: a technique for reducing the miss rate of direct-mapped caches , 1993, ISCA '93.

[3]  Kimming So,et al.  Cache Operations by MRU Change , 1988, IEEE Trans. Computers.

[4]  K. Kavi.  Cache Memories Cache Memories in Uniprocessors. Reading versus Writing. Improving Performance , 2022 .

[5]  A. Agarwal,et al.  Column-associative Caches: A Technique For Reducing The Miss Rate Of Direct-mapped Caches , 1993, Proceedings of the 20th Annual International Symposium on Computer Architecture.

[6]  Kimming So,et al.  Cache design of a sub-micron CMOS system/370 , 1987, ISCA '87.

[7]  Dirk Grunwald,et al.  Predictive sequential associative cache , 1996, Proceedings. Second International Symposium on High-Performance Computer Architecture.

[8]  Kazuaki Murakami,et al.  A High-Performance and Low-Power Cache Architecture with Speculative Way-Selection , 2000 .

[9]  Byung-Kwon Chung,et al.  Pseudo 3-way set-associative cache: a way of reducing miss ratio with fast access time , 1999, Engineering Solutions for the Next Millennium. 1999 IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.99TH8411).

[10]  T. H. Meyer.  Computer Architecture and Organization , 1982 .

[11]  David A. Patterson,et al.  Computer Architecture - A Quantitative Approach, 5th Edition , 1996 .

[12]  Anant Agarwal,et al.  Multiprocessor cache analysis using ATUM , 1988, ISCA '88.

[13]  Mark D. Hill,et al.  A case for direct-mapped caches , 1988, Computer.

[14]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[15]  Chenxi Zhang,et al.  Two fast and high-associativity cache schemes , 1997, IEEE Micro.

[16]  Alan Jay Smith,et al.  Experimental evaluation of on-chip microprocessor cache memories , 1984, ISCA '84.

[17]  John P. Hayes,et al.  Computer architecture and organization; (2nd ed.) , 1988 .

[18]  Yarsun Hsu,et al.  A quantitative evaluation of cache types , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[19]  Chenxi Zhang,et al.  Multi-column implementations for cache associativity , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[20]  André Seznec.  DASC cache , 1995, Proceedings of 1995 1st IEEE Symposium on High Performance Computer Architecture.

[21]  Mark Horowitz,et al.  Cache performance of operating system and multiprogramming workloads , 1988, TOCS.