Register allocation via dynamically updated information

淡江大學機構典藏 > 商管學院 > 資訊管理學系暨研究所 > 期刊論文 > Item 987654321/21080

請使用永久網址來引用或連結此文件: 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
顯示於類別:	[資訊管理學系暨研究所] 期刊論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
	0Kb	Unknown	410	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章