頁籤選單縮合
題名 | Register Allocation Via Dynamically Updated Information= |
---|---|
作者 | 賴飛羆; 葉家誠; 李鴻璋; |
期刊 | Journal of Information Science and Engineering |
出版日期 | 19920900 |
卷期 | 8:3 1992.09[民81.09] |
頁次 | 頁393-413 |
分類號 | 310.15 |
語文 | eng |
關鍵詞 | Interference; Graph-coloring; Register allocation; Spot; Estimation function; |
英文摘要 | Register allocation is a necessary component of most compilers, especially those for RISC machines. The former graph-coloring technique [1,2] has been recognized as an effective method. However, techniques based on graph-coloring suffer from the long live range problem and that of manipulating the large interference graph [3,4]. In this paper, a different register allocation algorithm using dynamically updated information is introduced. With this method, the live range of a variable is viewed as a collection of spots, which are the coordinate distances where the variable is used. Together with the usage counts of a variable and the increased weight on a variable in the loop structure, we estimate the cost of each variable already in the register. In case a spill is not avoidable, the variable in the register with minimum cost is chosen. Primary results show that this method diminishes the number of load/stores by about 21%, when compared with Chow's [5] graph-coloring method. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。