基于增量图着色的VLIW处理器寄存器分配

Xuemeng Zhang, Hui Wu, Haiyan Sun
{"title":"基于增量图着色的VLIW处理器寄存器分配","authors":"Xuemeng Zhang, Hui Wu, Haiyan Sun","doi":"10.1109/TrustCom.2013.113","DOIUrl":null,"url":null,"abstract":"This paper presents an incremental register allocator based on graph colouring for clustered VLIW processor. This register allocator is integrated with an instruction scheduler which schedules all the basic blocks of a program in reverse postorder and all the operations of each basic block based on their priorities. When scheduling an operation, the register allocator assigns physical registers to virtual registers of the operation by incremental graph colouring. Our approach is an integrated approach which can avoid the traditional phase ordering problem. We have simulated our approach and a previous approach CARS using a set of benchmarks. The simulation results show that our approach outperforms CARS by 9.03%, 13.43%, 10.35% for three processor models, respectively, in terms of the average schedule lengths of basic blocks.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Register Allocation by Incremental Graph Colouring for Clustered VLIW Processors\",\"authors\":\"Xuemeng Zhang, Hui Wu, Haiyan Sun\",\"doi\":\"10.1109/TrustCom.2013.113\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an incremental register allocator based on graph colouring for clustered VLIW processor. This register allocator is integrated with an instruction scheduler which schedules all the basic blocks of a program in reverse postorder and all the operations of each basic block based on their priorities. When scheduling an operation, the register allocator assigns physical registers to virtual registers of the operation by incremental graph colouring. Our approach is an integrated approach which can avoid the traditional phase ordering problem. We have simulated our approach and a previous approach CARS using a set of benchmarks. The simulation results show that our approach outperforms CARS by 9.03%, 13.43%, 10.35% for three processor models, respectively, in terms of the average schedule lengths of basic blocks.\",\"PeriodicalId\":206739,\"journal\":{\"name\":\"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications\",\"volume\":\"97 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TrustCom.2013.113\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TrustCom.2013.113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种基于图形着色的增量寄存器分配器,用于集群VLIW处理器。这个寄存器分配器与指令调度程序集成在一起,指令调度程序以反向顺序调度程序的所有基本块,并根据每个基本块的优先级调度它们的所有操作。当调度操作时,寄存器分配器通过增量图形着色将物理寄存器分配给该操作的虚拟寄存器。该方法是一种集成的方法,可以避免传统的相位排序问题。我们使用一组基准测试模拟了我们的方法和之前的方法CARS。仿真结果表明,在三种处理器型号上,我们的方法在基本块的平均调度长度方面分别比CARS算法高出9.03%、13.43%和10.35%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Register Allocation by Incremental Graph Colouring for Clustered VLIW Processors
This paper presents an incremental register allocator based on graph colouring for clustered VLIW processor. This register allocator is integrated with an instruction scheduler which schedules all the basic blocks of a program in reverse postorder and all the operations of each basic block based on their priorities. When scheduling an operation, the register allocator assigns physical registers to virtual registers of the operation by incremental graph colouring. Our approach is an integrated approach which can avoid the traditional phase ordering problem. We have simulated our approach and a previous approach CARS using a set of benchmarks. The simulation results show that our approach outperforms CARS by 9.03%, 13.43%, 10.35% for three processor models, respectively, in terms of the average schedule lengths of basic blocks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信