English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62379/95055 (66%)
造訪人次 : 2285217      線上人數 : 193
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/21080

    題名: Register allocation via dynamically updated information
    作者: 賴飛羆;Lai, Feipei;葉家誠;Yeh, Chia-cheng;李鴻璋;Lee, Hung-chang
    貢獻者: 淡江大學資訊管理學系
    關鍵詞: interference;graph-coloring;register allocation;spot;estimation function
    日期: 1992-09-01
    上傳時間: 2009-11-30 13:13:10 (UTC+8)
    出版者: 中央研究院資訊科學研究所
    摘要: 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.
    關聯: Journal of information science and engineering 8(3), pp.393-413
    顯示於類別:[資訊管理學系暨研究所] 期刊論文


    檔案 大小格式瀏覽次數



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋