.png){kind=icon}
返回
Data dependence analysis for array references
.png){kind=icon}
PRE
AI
DOI：10.1016/S0164-1212(99)00132-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Data dependence analysis is essential in order to determine whether a loop can be vectorized or parallelized. It is used to investigate whether two memory references in a loop are in the same location. In this paper we present a new scheme of exact data dependence analysis for array subscript analysis in parallel programs, called interval reduction (IR) test. This method reduces the solution interval of each constraint variable in the dependence equation by repeated projection. Once the effective solution interval of any variable shrinks to empty, this linear diophantine equation has no integer solution and the memory accesses subject to this constraint are then independent. Otherwise, all the integer solutions can be found, and thus the dependence distance can be computed as well. Experimental results are also presented to show its effectiveness compared to the Power test and the Omega test. (C) 2000 Published by Elsevier Science Inc. All rights reserved.
Keyword:
array references
data dependence analysis
interval reduction test
linear diophantine equation
parallelizing compilers
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
暂无机构信息
引用论文
Room-Temperature Palladium-Catalyzed Coupling of Heteroaryl Amines with Aryl or Heteroaryl Bromides.png)
Synlett
SynlettIF0
PREAI
分享收藏Long-term risk of depressive and anxiety symptoms after early bilateral oophorectomyMenopause
MenopauseIF0
PREAI
分享收藏
分享收藏
查看更多内容