In this work, the SPM allocation problem is formulated as an interval coloring problem. The key observation is that in many embedded applications, ...

Abstract. Existing methods place data or code in scratchpad memory, i.e.,. SPM by either relying on heuristics or resorting to integer program-.

Oct 22, 2024 · This insight has led to the development of an SPM allocation algorithm that places arrays in an interference graph in SPM by examining its ...

—We propose a dynamic SPM allocation approach that formulates the SPM man- agement problem for arrays as an interval coloring problem. —We demonstrate that the ...

This insight has led to the development of an SPM allocation algorithm that places arrays in an interference graph in SPM by examining its maximal cliques. If ...

This article develops an SPM allocation algorithm that places arrays in an interference graph in SPM by examining its maximal cliques and achieves ...

Oct 22, 2024 · This insight has led to the development of an SPM allocation algorithm that places arrays in an interference graph in SPM by examining its ...

Bibliographic details on Scratchpad allocation for data aggregates in superperfect graphs.

Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a ...

Scratchpad Memory Allocation for Data Aggregates via Interval Coloring in Superperfect Graphs. ACM Transactions on Embedded Computing Systems, 10(2), 1–42.