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.
Bartolini, S., Iacopo, C., Detti, P. (2014). Solving Graph Partitioning Problems Arising in Tagless Cache Management Combinatorial Optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp.50-61). Springer International Publishing [10.1007/978-3-319-09174-7_5].
Solving Graph Partitioning Problems Arising in Tagless Cache Management Combinatorial Optimization
BARTOLINI, SANDRO;DETTI, PAOLO
2014-01-01
Abstract
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.File | Dimensione | Formato | |
---|---|---|---|
LNCS-ISCO2014Final.pdf
non disponibili
Descrizione: Articolo
Tipologia:
Pre-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
296.2 kB
Formato
Adobe PDF
|
296.2 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/48311