| 基于GCC的IF转换算法的分析与改进 |
| |
| 引用本文： | 田祖伟 赵克佳. 基于GCC的IF转换算法的分析与改进[J]. 计算机科学, 2005, 32(7): 242-244 |
| |
| 作者姓名： | 田祖伟 赵克佳 |
| |
| 作者单位： | 1. 湖南省第一师范学校,长沙,410002;国防科学技术大学计算机学院,长沙,410073
2. 国防科学技术大学计算机学院,长沙,410073 |
| |
| 基金项目： | 国家“863”计划软件重大专项“高性能微处理器优化编译器”(2002AAIZ2105) |
| |
| 摘 要： | 分支指令是发掘指令级并行(ILP)的一个主要障碍。IF转换能够有效地删除指令流中的分支，通过删除程序中的莱些分支，将控制依赖转换为数据依赖。能够获得更好的调度效果。本文详细分析了GCC中基于IA-64谓词执行的IF转换算法，并改进了其算法。实验数据表明。优化效果明显。
|
| 关 键 词： | 转换算法 GCC 指令级并行 IA-64 删除程序 数据依赖 控制依赖 谓词执行 指令流 数据表 |
Analysis and Improvement of If-conversion Algorithm Based on GCC |
| |
| TIAN Zu-Wei,ZHAO Ke-Jia. Analysis and Improvement of If-conversion Algorithm Based on GCC[J]. Computer Science, 2005, 32(7): 242-244 |
| |
| Authors: | TIAN Zu-Wei ZHAO Ke-Jia |
| |
| Affiliation: | TIAN Zu-Wei,ZHAO Ke-Jia Hunan First Normal College,Changsha 410002 School of Computer,National University of Defence Technology,Changsha 410073 |
| |
| Abstract: | Branch instructions are recognized as a major impediment to exploiting instruction level parallelism If-con- version is an effective means to eliminate branches from an instruction stream. By eliminating some branch and con- verting control dependency to data dependency, thus a larger and better schedule effect can be obtained. In paper we analyze and improve the if-conversion algorithms based on IA-64's predicated execution in GCC. According to the re- sult of experiments, this algorithm can improve the performance of code optimization obviously. |
| |
| Keywords: | Instruction level parallelism GCC Predicated execution If-conversion |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
