Super-perfect Graph Coloring Based Memory Allocation Algorithms
Guibin Wang · 2008
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 turn the general interference graph into super-perfect graph by live-range splitting and then use an existing linear time interval coloring algorithm to allocate the memory.Two allocation algorithms are implemented according to different live-range splitting strategies:a top-down aggressive strategy and a bottom-up passive strategy.Preliminary modeling tests show that they are efficient approaches for compile-time memory allocation.