Applying Traversal-Pattern-Sensitive Pointer Analysis to Dependence Analysis.pdfVIP

下载本文档

1
0
约4.82万字
约 18页
2017-04-06 发布于江苏
举报
版权申诉

Applying Traversal-Pattern-Sensitive Pointer Analysis to Dependence Analysis.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Applying Traversal-Pattern-Sensitive Pointer Analysis to Dependence Analysis

Applying Traversal-Pattern-Sensitive Pointer Analysis to Dependence Analysis Yuan-Shin Hwang Joel Saltz Department of Computer Science University of Maryland College Park, MD 20742fshin, saltzg@ November 12, 1997 Abstract This paper presents a technique for dependence analysis on programs with pointers or dynamic recursive data structures. It differs from previously proposed approaches in analyzing structure access conflicts between traversal patterns before gathering alias and connection information. Conflict analysis is conducted under the assumption that each unique path leads to a distinct storage location, and hence traversal patterns can be analytically compared to identify possible conflicts. The rationale of this assumption is that if statements are deemed to be dependent by this approach, they are inherently sequential regardless of the shapes of the data structures they traverse. Consequently, there is no need to perform alias/connection analysis on the statements that construct such data structures. Furthermore, the information of traversal patterns gathered in conflict analysis phase can direct alias/connection analysis algorithm to focus on statements that are crucial to optimizations or parallelization. A such traversal- pattern-sensitive pointer analysis algorithm will also be presented. This work was sponsored in part by NSF (ASC-9213821 and CDA9401151). 1 Introduction Dependence analysis is the key technique behind parallelization and optimizationson programs with pointers or recursive data structures. There have been several algorithms proposed by researchers [7, 8, 9, 10, 14]. It is a considerably complicated problem, since it involves other pointer analysis techniques as well, such as alias analysis [2, 4, 5, 12, 20], side effect analysis [2, 13], and even shape analysis [1, 6, 16, 18]. These proposed dependence analysis techniques first identify aliases of pointer variables and connections of recursive data structures by examining all pointe