Fighting space complexity of compile time cache management schemes

Compile time optimizations have been an intensive research area in uniprocessor environment. However, due the NP-completness of most of the problems dealt with and the various nature of programs, these optimizations have been applied with various successes. While in many cases it is theoretically possible to solve the problems, in practice the proposed methods run into space or/and time problems. In this paper, we propose the use of a linear space algorithm for the data cache compile time management problem and propose an admissible heuristic.