Compiler-Assisted Cache Replacement: Problem Formulation and Performance Evaluation

Yang, Hongbo and Govindarajan, R and Gao, Guang R and Hu, Ziang (2004) Compiler-Assisted Cache Replacement: Problem Formulation and Performance Evaluation. In: 16th International Workshop, LCPC, October 2-4, 2003, USA.

Preview

PDF 27.pdf Download (131kB)

Abstract

Recent research results show that conventional hardware-only cache solutions result in unsatisfactory cache utilization for both regular and irregular applications. To overcome this problem, a number of architectures introduce instruction hints to assist cache replacement. For example, Intel Itanium architecture augments memory accessing instructions with cache hints to distinguish data that will be referenced in the near future from the rest. With the availability of such methods, the performance of the underlying cache architecture critically depends on the ability of the compiler to generate code with appropriate cache hints. In this paper we formulate this problem – giving cache hints to memory instructions such that cache miss rate is minimized – as a 0/1 knapsack problem, which can be efficiently solved using a dynamic programming algorithm. The proposed approach has been implemented in our compiler testbed and evaluated on a set of scientific computing benchmarks. Initial results show that our approach is effective on reducing the cache miss rate and improving program performance.

Item Type:	Conference Paper
Publisher:	Springer
Additional Information:	Copyright of this article belongs to Springer.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	18 Dec 2008 09:59
Last Modified:	19 Sep 2010 04:53
URI:	http://eprints.iisc.ac.in/id/eprint/16781

Actions (login required)

View Item