Abstract
An approach is presented permitting for extracting both affine and non-linear synchronization-free slices in program loops. It requires an exact dependence analysis. To describe and implement the approach, the dependence analysis by Pugh and Wonnacott was chosen where dependences are found in the form of tuple relations. The approach is based on operations on integer tuple relations and sets and it has been implemented and verified by means of the Omega project software. Results of experiments with the UTDSP benchmark suite are discussed. Speed-up and efficiency of parallel code produced by means of the approach is studied. © 2010 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Bielecki, W., & Palkowski, M. (2010). Extracting both affine and non-linear synchronization-free slices in program loops. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6067 LNCS, pp. 196–205). https://doi.org/10.1007/978-3-642-14390-8_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
