Anant Agarwal
- 1.Alan Jay Smith. Cache Memories. Computing Surveys, 14(4):473-530, September 1982. Google Scholar
Digital Library
- 2.Steven Przybylski, Mark Horowitz, and John Hermessy. Performance Tradeoffs in Cache Design. In Proceedings of the 15th Annual Symposium on Computer Architecture, pages 290--298. IEEE Computer Society Press, June 1988. Google ScholarDigital Library
- 3.Mark D. Hill. A Case for Direct-Mapped Caches. IEEE Computer, 21(12):25-40, December 1988. Google ScholarDigital Library
- 4.Norman P. Jouppi. Improving Direct-Mapped Cache Performance by the Addition of a Small Fully-Associative Cache and Prefetch Buffers. In Proceedings of the 17th Annual Symposium on Computer Architecture, pages 364-373. IEEE Computer Society Press, August 1990. Google ScholarDigital Library
- 5.Anant Agarwal, John Hennessy, and Mark Horowitz. Cache Performance of Operating Systems and Multiprogrmmning. ACM Transactions on Computer Systems, 6(4):393-431, November 1988. Google ScholarDigital Library
- 6.Matthew K. Fattens and Andrew R. Pleszkun. Improving Performance of Small On-Chip Instruction Caches. In Proceedings of the 16th Annual Symposium on Computer Architecture, pages 234-241. IEEE Computer Society Press, May 1989. Google ScholarDigital Library
- 7.R.E. Kessler, Richard Jooss, Alvin Lebeck, and Mark D. Hill. inexpensive Implementations of Set-Associativity. In Proceedings of the 16th Annual Symposium on Computer Architecture, pages 131-139. IEEE Computer Society Press, May 1989. Google ScholarDigital Library
- 8.Kimming So and Rudolph N. Rechtschaffen. Cache Operations by MRU Change. Technical Report RC 11613, IBM T.J. Watson Research Center, November 1985.Google Scholar
- 9.Anant Agarwal, Mark Horowitz, and John Hennessy. An Analytical Cache Model. ACM Transactions on Computer Systems, 7(2):184-215, May 1989. Google ScholarDigital Library
- 10.Alan Jay Smith. A Comparative Study of Set Associative Memory Mapping Algorithms And Their Use for Cache and Main Memory. IEEE Transactions on Software Engineering, SE-4(2):121-130, March 1978.Google ScholarDigital Library
- 11.Dominique Thiebaut and Harold S. Stone. Foo~ts in the Cache. ACM Transactions on Computer Systems, 5(4):305- 329, November 1987. Google ScholarDigital Library
- 12.Anant Agarwal and Steven Pudar. Column-Associative Caches: A Technique for Reducing the Miss Rate of Direct- Mapped Caches. Technical Report LCS TM 484, MIT, March 1993. Google ScholarDigital Library
- 13.M.D. Hill and A. J. Smith. Evaluating Associativity in CPU Caches. IEEE Transactions on Computers, 38(12):1612-- 1630, December 1989. Google ScholarDigital Library
- 14.Richard L. Sites and AnantAgarwal. Multiprocessor Cache Analysis using ATUM. In Procecdin$$ of the 15th Interna. tional Symposium on Computer Architecture, pages 186--195, New York, June 1988. IEEE. Google Scholar
Index Terms
- Column-associative caches: a technique for reducing the miss rate of direct-mapped caches
Recommendations
Reactive-Associative Caches
PACT '01: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation TechniquesAbstract: While set-associative caches typically incur fewer misses than direct-mapped caches, set-associative caches have slower hit times. We propose the reactive-associative cache (r-a cache), which provides flexible associativity by placing most ...
Snug set-associative caches: Reducing leakage power of instruction and data caches with no performance penalties
As transistors keep shrinking and on-chip caches keep growing, static power dissipation resulting from leakage of caches takes an increasing fraction of total power in processors. Several techniques have already been proposed to reduce leakage power by ...
LRU-based column-associative caches
The column-associative cache is a direct-mapped cache that may be accessed more than once, each time with a different hash function, to satisfy a memory request. In the column-associative cache, the possible locations that a line can reside in defines ...
Comments