Instruction Hints for Super Efficient Data Caches

  • Authors:
  • Jie Tao;Dominic Hillenbrand;Holger Marten

  • Affiliations:
  • Steinbuch Center for Computing Forschungszentrum Karlsruhe, Karlsruhe Institute of Technology, Germany;Computer Laboratory, University of Cambridge, United Kingdom;Steinbuch Center for Computing Forschungszentrum Karlsruhe, Karlsruhe Institute of Technology, Germany

  • Venue:
  • ICCS 2009 Proceedings of the 9th International Conference on Computational Science
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data cache is a commodity in modern microprocessor systems. It is a fact that the size of data caches keeps growing up, however, the increase in application size goes faster. As a result, it is usually not possible to store the complete working set in the cache memory. This paper proposes an approach that allows the data access of some load/store instructions to bypass the cache memory. In this case, the cache space can be reserved for storing more frequently reused data. We implemented an analysis algorithm to identify the specific instructions and a simulator to model the novel cache architecture. The approach was verified using applications from MediaBench /MiBench benchmark suite and for all except one application we achieved huge gains in performance.