English  |  正體中文  |  简体中文  |  Items with full text/Total items : 60899/93651 (65%)
Visitors : 1193870      Online Users : 24
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/21080


    Title: Register allocation via dynamically updated information
    Authors: 賴飛羆;Lai, Feipei;葉家誠;Yeh, Chia-cheng;李鴻璋;Lee, Hung-chang
    Contributors: 淡江大學資訊管理學系
    Keywords: interference;graph-coloring;register allocation;spot;estimation function
    Date: 1992-09-01
    Issue Date: 2009-11-30 13:13:10 (UTC+8)
    Publisher: 中央研究院資訊科學研究所
    Abstract: 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.
    Relation: Journal of information science and engineering 8(3), pp.393-413
    Appears in Collections:[Graduate Institute & Department of Information Management] Journal Article

    Files in This Item:

    File SizeFormat
    0KbUnknown387View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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