%0 Journal Article
%T A Basic-Block Reordering Algorithm Based on Structural Analysis<br>一种基于子结构分析的基本块重排算法
%A LIU Xian-Hu
%A YANG Yang
%A ZHANG Ji-Yu
%A CHENG Xu
%A <br>刘先华
%A 杨阳
%A 张吉豫
%A 程旭
%J 软件学报
%D 2008
%I 
%X Basic-Block reordering is a kind of compiler optimization technique which has the effect of reducing branch penalty and I-cache miss cost by reordering basic blocks in memory. A new basic-block reordering algorithm based on structural analysis is presented. The algorithm takes the architectural branch cost model and basic-block layout cost model into consideration, uses the execution frequencies of control-flow edges from profile information, builds a local structural optimization policy and utilizes it in reordering program's basic blocks. The algorithm is implemented based on UniCore architecture, experimental results show that it better improved programs' performance with a complexity of only O(n(logn).
%K basic-block reordering
%K structural analysis
%K compiler optimization<br>基本块重排
%K 子结构分析
%K 编译优化
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=3E59AC170C2FC36E1336D807721B3CC5&yid=67289AFF6305E306&vid=2A8D03AD8076A2E3&iid=DF92D298D3FF1E6E&sid=2E97FDBA239991ED&eid=2E3D2E3C7A6F11A2&journal_id=1000-9825&journal_name=软件学报&referenced_num=2&reference_num=17