首页> 外文会议>Languages and compilers for parallel computing >Analysis and Optimization of Explicity Parallel Programs Using the Parallel Program Graph Representation
【24h】

Analysis and Optimization of Explicity Parallel Programs Using the Parallel Program Graph Representation

机译:使用并行程序图表示法分析和优化显式并行程序

获取原文
获取原文并翻译 | 示例

摘要

Major changes in processor architecture over the last decade have created a demand for new compiler optimization technologies. Optimizing compilers have risen to this challenge by steadily increasing the uniprocessor performance gap between optimized compiled and unoptimized compiled code to a level that already exceeds the performance gap between two successive generations of processor hardware. These traditional optimizations [2] have been developed in the context of sequential programs -- the assumption of sequential control flow is intrinsic to the definition of dasic optimization data structures such as the control flow graph (CFG), and pervades all the optimization algorithms.
机译:过去十年中,处理器体系结构的重大变化产生了对新编译器优化技术的需求。通过稳定地将优化的编译和未优化的编译代码之间的单处理器性能差距提高到已经超过两代连续的处理器硬件之间的性能差距的水平,优化编译器已经迎接了这一挑战。这些传统的优化方法[2]是在顺序程序的上下文中开发的-顺序控制流的假设是基本优化数据结构(如控制流图(CFG))的定义所固有的,并且遍及所有优化算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号