{"title":"Register allocation for data flow graphs with conditional branches and loops","authors":"Chaeryung Park, Taewhan Kim, C. Liu","doi":"10.1109/EURDAC.1993.410643","DOIUrl":null,"url":null,"abstract":"A new approach to the problem of register allocation in the presence of both conditional branches and loops in a data flow graph is presented. The authors algorithm exploits the possibility of register sharing among mutually exclusive variables using a transformational approach - sets of mutually exclusive variables are transformed into an equivalent set of non-mutually exclusive variables. The transformational approach is extended to the case of data flow graphs with loops. A new register allocation algorithm is then used to produce an allocation for the non-mutually exclusive variables. From such an allocation, a corresponding allocation for the original sets of mutually exclusive variables is derived. Experimental results show that the approach is quite effective.<<ETX>>","PeriodicalId":339176,"journal":{"name":"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURDAC.1993.410643","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
A new approach to the problem of register allocation in the presence of both conditional branches and loops in a data flow graph is presented. The authors algorithm exploits the possibility of register sharing among mutually exclusive variables using a transformational approach - sets of mutually exclusive variables are transformed into an equivalent set of non-mutually exclusive variables. The transformational approach is extended to the case of data flow graphs with loops. A new register allocation algorithm is then used to produce an allocation for the non-mutually exclusive variables. From such an allocation, a corresponding allocation for the original sets of mutually exclusive variables is derived. Experimental results show that the approach is quite effective.<>