S. J. Walsh and J. A. Board,"Pollution Control Caching," VLSI in Computers & Processors, pp. 300--306, Oct. 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Trends in High-Performance, Low-Power Cache Memory.. - Inoue, Moshnyaga, Murakami (2001) (Correct)
....time and the cache hit rate when we consider the cache resource distribution to the direct mapped region and the set associative region. Against to the victim cache and the half and half cache, the annex cache proposed by John et al. 23] and the pollution control cache proposed by Walsh et al. [62] attempt to filter the data to be loaded into the main cache. Both the annex cache and the pollution control cache are small high associative caches attached to the main cache. On a cache miss, the missed data is loaded into the small associative cache, instead of the main cache. Then the cache ....
S. J. Walsh and J. A. Board,"Pollution Control Caching," VLSI in Computers & Processors, pp. 300--306, Oct. 1995.
Annex Cache: A Cache Assist to Implement Selective Caching - John, Li, Subramanian (1999) (1 citation) (Correct)
....a secondary section of higher associativity. Some examples of schemes to improve performance of direct mapped caches are victim caches [1] hash rehash caches [2] column associative caches [3] MRU caches [4] half and half caches [5] conflict avoiding caches [6] and pollution control caches [7]. A victim cache [1] is a small fully associative cache of typically no more than 16 blocks. If a block in the main direct mapped cache has to be replaced, that entry (called the victim) is transferred to the victim cache. The intent is that the next time there is a need for this entry, it can be ....
....associative rather than fullyassociative. The conflict avoiding cache [6] is based on polynomial modulus functions and demonstrates that pseudo randomly indexed caches are effective in performance terms and practical from an implementation viewpoint. Pollution control caching from Walsh and Board [7] is another effort to improve performance of caches by controlling pollution of caches by non conventional replacement algorithms. Typically whenever there is a cache miss, the newly requested information enters the cache. Cache bypassing schemes typically passes the information directly from the ....
S.J. Walsh, J.A. Board, Pollution control caching, Proceedings of the 1995 International Conference on Computer Design.
Design of Trace Caches for High Bandwidth Instruction Fetching - Sung (Correct)
No context found.
S. J. Walsh and J. A. Board, "Pollution Control Caching," Proceedings of the International Conference on Computer Design: VLSI in Computers and Processors, 1995
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC