[Zurück]


Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag):

J. Knoop, O. Rüthing:
"Constant Propagation on Predicated Code";
Vortrag: 7th Brazilian Symposium on Programming Languages, Ouro Preto, Brazil; 28.05.2003 - 30.05.2003; in: "Proceedings of the 7th Brazilian Symposium on Programming Languages (SBLP 2003)", (2003), ISBN: 85-88442-45-0; S. 135 - 148.



Kurzfassung deutsch:































Kurzfassung englisch:
We 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. As an additional benefit, it identifies off-predicated instructions in predicated code, which can simply be eliminated thereby further increasing the performance and simplifying later compilation phases such as instruction scheduling.


Online-Bibliotheks-Katalog der TU Wien:
http://aleph.ub.tuwien.ac.at/F?base=tuw01&func=find-c&ccl_term=AC04404577

Elektronische Version der Publikation:
knoop@complang.tuwien.ac.at,


Erstellt aus der Publikationsdatenbank der Technischen Universitšt Wien.