.png){kind=icon}
Return
TC: Optimizing compiler
.png){kind=icon}
OA
AI
DOI：10.1016/j.softx.2025.102351.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In scientific codes, particularly those used in simulations, the majority of execution time is consumed by the processing of program loops. However, the ordering of statement instances constituting a loop nest, which arises from its naive, typically hand-written implementation, usually leads to inefficient and suboptimal utilization of hardware resources. Over the past decades, significant research efforts have been devoted to developing loop nest transformations aimed at enhancing thread-and instruction-level parallelism, as well as improving memory hierarchy usage, with the affine transformations framework becoming the canonical approach. This paper presents TC-a source-to-source optimizing compiler for program loop nests. Unlike state-ofthe-art solutions, TC extends the polyhedral compilation pipeline with a data dependence analysis based on the transitive closure relation, significantly broadening the range of optimization opportunities.
Keywords:
Optimizing compiler
Polyhedral model
Transitive closure
Tiling
Loop nests
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.4
Papers:
346
Citations:
7.3K
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveCounting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions.png)
Algorithmica
OAAI
AlgorithmicaIF0
OAAIShareSave
View more