Abstract
Global source code transformations, such as Global Loop Transformations (GLT), are usually performed on a Geometrical Model (GM) which is very effective in dealing with complex transformations. However, this model imposes strict limitations on the input code, and it is not capable to deal with data dependent conditions. The technique presented in this paper can deal with data dependent conditions at any loop level. At the outermost loop level hot code paths are grouped together into limited number of clusters called scenarios to maximise the GLT benefit for a given code size growth. On the middle and innermost loop level we manipulate the abstract syntax tree to move the data dependent conditions out of the GLT optimisation scope. Results show up to 45.8% improvement compared to state-of-the-art.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
