程序与编译器的组合优化方法.pptVIP

  1. 1、本文档共14页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Responsible Pointer Usage Compiler alias analysis limits optimizations Developer knows App – tell compiler! Avoid pointing to same memory address with 2 different pointers Use array notation when possible Avoid pointer arithmetic if possible Pointer Disambiguation -Oa file.c (Windows) -fno-alias file.c (Linux) All pointers in file.c are assumed not to alias -Ow file.c (Windows) Not (yet) on Linux Assume no aliasing within functions (ie, pointer arguments are unique) -Qrestrict file.c (Windows) -restrict (Linux) Restrict Qualifier: Enables pointer disambiguation -Za file.c (Windows) -ansi (Linux) Enforce strict ANSI compilance (requires that pointers to different data types are not aliased) High Level Optimizations Available at O3 Prefetch Loop interchange Unrolling Cache blocking Unroll-and-jam Scalar replacement Redundant zero-trip elimination Data dependence analysis Reuse analysis Loop recovery Canonical expressions Loop fusion Loop distribution Loop reversal Loop skewing Loop peeling Scalar expansion Register blocking Data Prefetching Loop Interchange Note: c[i][j] term is constant in inner loop Interchange to allow unit stride memory access Unit Stride memory access C/C++ Example – Fortran opposite Loop after interchange Note: a[i][k] term is constant in inner loop Two loads, one Store, one FMA: F/M = .33, Unit stride Unit Stride memory access (C/C++) Loop Unrolling Loop Unrolling - Candidates If trip count is low and known at compile time it may make sense to Fully unroll Poor Candidates: (similar issues for SWP or vectorizer) Low trip count loops – for (j=0; j N; j++) : N=4 at runtime Fat loops – loop body already has lots of computation taking place Loops containing procedure calls Loops with branches Loop Unrolling - Benefits Benefits perform more computations per loop iteration Reduces the effect of loop overhead Can increase Floating point to memory access ratio (F/M) Costs Register pressure Code bloat Loop Unrolling - Example All loop

文档评论(0)

118books + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档