.png){kind=icon}
返回
Optimally Maximizing Iteration-Level Loop Parallelism
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2011.171.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Loops are the main source of parallelism in many applications. This paper solves the open problem of extracting the maximal number of iterations from a loop to run parallel on chip multiprocessors. Our algorithm solves it optimally by migrating the weights of parallelism-inhibiting dependences on dependence cycles in two phases. First, we model dependence migration with retiming and formulate this classic loop parallelization into a graph optimization problem, i.e., one of finding retiming values for its nodes so that the minimum nonzero edge weight in the graph is maximized. We present our algorithm in three stages with each being built incrementally on the preceding one. Second, the optimal code for a loop is generated from the retimed graph of the loop found in the first phase. We demonstrate the effectiveness of our optimal algorithm by comparing with a number of representative nonoptimal algorithms using a set of benchmarks frequently used in prior work and a set of graphs generated by TGFF.
Keyword:
Loop parallelization
loop transformation
retiming
data dependence graph
iteration-level parallelism
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
Long-term risk of depressive and anxiety symptoms after early bilateral oophorectomy.png)
Menopause
MenopauseIF0
PREAI
分享收藏Clinical Predictors of Response to Clozapine Treatment in Ambulatory Patients With Schizophrenia
PREAI
分享收藏Optimised Anaesthesia to Reduce Post Operative Cognitive Decline (POCD) in Older Patients Undergoing Elective Surgery, a Randomised Controlled TrialPLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容