DASC cache

For many microprocessors, cache hit time determines the clock cycle. On the other hand, cache miss penalty(measured in instruction issue delays) becomes higher and higher. Conciliating low cache miss ratio with low cache hit time is an important issue. When caches are virtually indexed, the operating system (or some specific hardware) has to manage data consistency of caches and memory. Unfortunately, conciliating physical indexing of the cache and low cache hit time is very difficult. In this paper, we propose the Direct-mapped Access Set-associative Check cache (DASC) for addressing both difficulties. On a DASC cache, the cache array is direct-mapped, so the cache hit time is low. However the tag array is set-associative and the external miss ratio on a DASC cache is the same as the miss ratio on a set-associative cache. When the size of an associativity degree of the tag array is tied to the minimum page size, a virtually indexed but physically tagged DASC cache correctly handles all difficulties associated with cache consistency. Trace driven simulations show that, for cache sizes in the range of 16 to 64 Kbytes and for page sizes in the range 4 to 8 Kbytes, a DASC cache is a valuable trade-off allowing fast cache hit time and low cache miss ratio while cache consistency management is performed by hardware.<<ETX>>

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

[2]  André Seznec,et al.  Semi-unified Caches , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[3]  Norman P. Jouppi,et al.  Improving direct-mapped cache performance by the addition of a small fully-associative cache and pre , 1990, ISCA 1990.

[4]  Alan Jay Smith,et al.  Evaluating Associativity in CPU Caches , 1989, IEEE Trans. Computers.

[5]  John L. Hennessy,et al.  Performance directed memory hierarchy design , 1988 .

[6]  S. G. Tucker,et al.  The IBM 3090 System: An Overview , 1986, IBM Syst. J..

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

[8]  Norman P. Jouppi,et al.  Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[9]  T. Wada,et al.  An analytical access time model for on-chip cache memories , 1992 .

[10]  R. E. Kessler,et al.  Inexpensive implementations of set-associativity , 1989, ISCA '89.

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

[12]  W. H. Wang,et al.  Organization and performance of a two-level virtual-real cache hierarchy , 1989, ISCA '89.

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

[14]  N. P. Jouppi Architectural and organizational tradeoffs in the design of the MultiTitan CPU , 1989, ISCA '89.

[15]  Randy H. Katz,et al.  Eliminating the address translation bottleneck for physical address cache , 1992, ASPLOS V.

[16]  Lishing Liu Partial address directory for cache access , 1994, IEEE Trans. Very Large Scale Integr. Syst..

[17]  Wen-Hann Wang,et al.  Revisit the case for direct-mapped chaches: a case for two-way set-associative level-two caches , 1992, ISCA '92.

[18]  Wen-Hann Wang,et al.  Revisit the Case for Direct-Mapped Caches: a Case for Two-Way Set-Associative Level-Two Caches , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.