Reduction of Instruction Increase Overhead by STRAIGHT Compiler

Toru Koizumi, Satoshi Nakae, A. Fukuda, H. Irie, S. Sakai
{"title":"Reduction of Instruction Increase Overhead by STRAIGHT Compiler","authors":"Toru Koizumi, Satoshi Nakae, A. Fukuda, H. Irie, S. Sakai","doi":"10.1109/CANDARW.2018.00026","DOIUrl":null,"url":null,"abstract":"It is effective to remove false dependencies to efficiently perform out-of-order (OoO) execution which improves single thread performance. Hardware register renaming removes these dependencies, but it is one of the bottlenecks of the processor because of its complexity. The use of a STRAIGHT architecture is one of the approaches that allow the compiler to remove these dependencies. Because the source operand is specified as the distance between the producer instruction and consumer instruction and there is no register overwriting, no false dependency occurs. Instead, the compiler must generate code that satisfies the constraint of specifying operands as constant distances that are not dependent on the execution path. Although the basic algorithms for realizing the constraint are already known, the machine code generated thereby cannot achieve high performance because it is necessary to execute many inter-register transfer instructions added by compiler to satisfy the constraints. This paper presents an efficient algorithm that uses data flow analysis to determine the value causing an increase in the number of executed instructions and improve the performance by spilling them on the stack. We developed a compiler that implements the proposed method using LLVM and evaluated using CoreMark as a benchmark. The number of executed instructions was reduced by approximately 31 %, and the execution performance improved by up to 32 %.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CANDARW.2018.00026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

It is effective to remove false dependencies to efficiently perform out-of-order (OoO) execution which improves single thread performance. Hardware register renaming removes these dependencies, but it is one of the bottlenecks of the processor because of its complexity. The use of a STRAIGHT architecture is one of the approaches that allow the compiler to remove these dependencies. Because the source operand is specified as the distance between the producer instruction and consumer instruction and there is no register overwriting, no false dependency occurs. Instead, the compiler must generate code that satisfies the constraint of specifying operands as constant distances that are not dependent on the execution path. Although the basic algorithms for realizing the constraint are already known, the machine code generated thereby cannot achieve high performance because it is necessary to execute many inter-register transfer instructions added by compiler to satisfy the constraints. This paper presents an efficient algorithm that uses data flow analysis to determine the value causing an increase in the number of executed instructions and improve the performance by spilling them on the stack. We developed a compiler that implements the proposed method using LLVM and evaluated using CoreMark as a benchmark. The number of executed instructions was reduced by approximately 31 %, and the execution performance improved by up to 32 %.
利用STRAIGHT编译器减少指令增加开销
消除虚假依赖可以有效地执行乱序(OoO)执行,从而提高单线程性能。硬件寄存器重命名消除了这些依赖关系,但由于其复杂性,它是处理器的瓶颈之一。使用STRAIGHT体系结构是允许编译器删除这些依赖关系的方法之一。由于源操作数被指定为生产者指令和消费者指令之间的距离,并且没有寄存器覆盖,因此不会发生错误的依赖关系。相反,编译器必须生成满足将操作数指定为不依赖于执行路径的恒定距离的约束的代码。虽然实现约束的基本算法已经已知,但由于需要执行编译器为满足约束而添加的许多寄存器间传输指令,因此生成的机器码不能达到高性能。本文提出了一种有效的算法,利用数据流分析来确定导致执行指令数量增加的值,并通过将它们溢出到堆栈上来提高性能。我们开发了一个编译器,使用LLVM实现了所提出的方法,并使用CoreMark作为基准进行了评估。执行指令的数量减少了大约31%,执行性能提高了多达32%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信