Unrestricted code motion: A program representation and transformation algorithms based on future values
Document Type
Conference Proceeding
Publication Date
2010
Department
Department of Computer Science
Abstract
We introduce the concept of future values. Using future values it is possible to represent programs in a new control-flow form such that on any control flow path the data-flow aspect of the computation is either traditional (i.e., definition of a value precedes its consumers), or reversed (i.e., consumers of a value precede its definition). The representation hence allows unrestricted code motion since ordering of instructions are not prohibited by the data dependencies. We present a new program representation called Recursive Future Predicated Form (RFPF) which implements the concept. RFPF subsumes general if-conversion and permits unrestricted code motion to the extent that the whole procedure can be reduced to a single block. We develop algorithms which enable instruction movement in acyclic as well as cyclic regions and give examples of various optimizations in RFPF form.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISBN
978-3-642-11970-5
Recommended Citation
Ding, S.,
&
Onder, S.
(2010).
Unrestricted code motion: A program representation and transformation algorithms based on future values.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
6011 LNCS, 26-45.
http://doi.org/10.1007/978-3-642-11970-5_3
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/4177