• Home
  • Search
  • IPC driven dynamic associative cache architecture for low energy
  • https://doi.org/10.1109/iccd.2004.1347964Copy DOI Icon

IPC driven dynamic associative cache architecture for low energy

  • Oct 11, 2004
  • S Nadathur +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

Existing schemes for cache energy optimization incorporate a limited degree of dynamic associativity: either direct mapped or full available associativity (say 4-way). In this paper, we explore a more general design space for dynamic associativity (for a 4-way associative cache, consider 1-way, 2-way, and 4-way associative accesses). The other major departure is in the associativity control mechanism. We use the actual instruction level parallelism exhibited by the instructions surrounding a given load to classify it as an IPC k load (for 1/spl les/k/spl les/IW with an issue width of IW) in a superscalar architecture. The lookup schedule is fixed in advance for each IPC classifier 1/spl les/k/spl les/IW. The schedules are as way-disjoint as possible for load/stores with different IPC classifications. The energy savings over SPEC2000 CPU benchmarks average 28.6% for a 32 kB, 4-way, L-1 data cache. The resulting performance (IPC) degradation from the dynamic way schedule is restricted to less than 2.25%, mainly because IPC based placement ends up being an excellent classifier.

Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.