Solving Graph Partitioning Problems Arising in Tagless Cache Management
The instruction cache is a critical component in any microprocessor. It must have high performance to enable fetching of instructions on every cycle. In this paper, we consider an optimization problem arising in the management of a new hybrid hardware and linker-assisted approach for cache memory management. A graph partitioning formulation is presented and different ILP formulations are proposed, obtained by strengthening and/or relaxing constraints and by reducing the number of integer variables. The formulations are tested on large benchmarks (with thousands of nodes and edges) arising from real applications.
KeywordsCache memory Graph partitioning Integer programming
The authors would like to thank Tim M. Jones and Jonas Maebe for the discussion about the tagless cache operation and for the preparation of the input data used in this work. This work was partially supported by IT FIRB PHOTONICA project (RBFR08LE6V).
- 8.Jones, T.M., Bartolini, S., Maebe, J., Chanet, D.: Link-time optimization for power efficiency in a tagless instruction cache. In: 2011 9th Annual IEEE/ACM International Symposium on Code Generation and Optimization (CGO), pp. 32–41 (2011)Google Scholar