Constant Propagation on Predicated Code

Простая страница элемента
dc.creatorKnoop,Jens
dc.creatorRüthing,Oliver
dc.date2003
dc.date.accessioned2024-02-06T12:52:32Z
dc.date.available2024-02-06T12:52:32Z
dc.descriptionWe present a new constant propagation (CP) algorithm for predicated code, for which classical CP-techniques are inadequate. The new algorithm works for arbitrary control flow, detects constancy of terms, whose operands are not constant themselves, and is optimal for acyclic code such as hyperblocks, the central "compilation units" for instruction scheduling of predicated code. The new algorithm operates on the predicated value graph, an extension of the well-known value graph of Alpern et al. [Alpern et al., 1988], which is tailored for predicated code and constructed on top of the predicate-sensitive SSA-form, which has been introduced by Carter et al. [Carter et al., 1999]. As an additional benefit, the new algorithm identifies off-predicated instructions in predicated code. They can simply be eliminated thereby further increasing the performance and simplifying later compilation phases such as instruction scheduling.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-009-08-0829
dc.identifierhttps://lib.jucs.org/article/28086/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8386
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 9(8): 829-850
dc.subjectconstant propagation
dc.subjectpredicated code
dc.subjectIA-4
dc.subjectpredicated SSA-form
dc.subjectpredicated value graph
dc.subjectdata-flow analysis
dc.subjectoptimization
dc.titleConstant Propagation on Predicated Code
dc.typeResearch Article
Файлы
Коллекции