Abstract: In some special applications, the main memory needs to be managed by the compiler to improve the performance. Memory allocation algorithms based on super-perfect graph coloring are proposed. The basic idea is to tutti the general interference graph into s

Key words: Compile-time memory allocation, Main memory management, Interval coloring, Super-perfect graph