%0 Journal Article
%T Super-perfect Graph Coloring Based Memory Allocation Algorithms<br>基于超完美图着色的存储分配算法
%A DENG Yu
%A WANG Li
%A YAN Xiao-bo
%A WANG Gui-bin
%A <br>邓宇
%A 汪黎
%A 晏小波
%A 王桂彬
%A 唐滔
%J 计算机科学
%D 2008
%I 
%X 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 an...
%K Compile-time memory allocation
%K Main memory management
%K Interval coloring
%K Super-perfect graph<br>编译时存储分配
%K 主存管理
%K 区间着色
%K 超完美图
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=B7C985239A84FEE8F6B1A24E92E29A3A&yid=67289AFF6305E306&vid=6209D9E8050195F5&iid=9CF7A0430CBB2DFD&sid=FD7C952458BFB5D8&eid=FBCA02DBD05BD4EA&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=13