.png){kind=icon}
Return
Optimally Maximizing Iteration-Level Loop Parallelism
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2011.171.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Loop parallelization
loop transformation
retiming
data dependence graph
iteration-level parallelism
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
Cited Papers
ShareSaveLong-term risk of depressive and anxiety symptoms after early bilateral oophorectomy.png)
Menopause
MenopauseIF0
PREAI
ShareSaveClinical Predictors of Response to Clozapine Treatment in Ambulatory Patients With Schizophrenia
PREAI
ShareSaveShareSaveShareSaveOptimised Anaesthesia to Reduce Post Operative Cognitive Decline (POCD) in Older Patients Undergoing Elective Surgery, a Randomised Controlled TrialPLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveShareSave
View more