Abstract
Compiler optimization and transformation techniques focus on eliminating branches from the instruction stream and overlapping the execution of multiple control flow paths using the conditional execution capabilities provided by predication. The compiler support for predicate[1] execution is based on hyperblock, which is a generalized form of superblock that takes advantage of both predicated and speculative execution. The paper discusses the compilation techniques of hyperblock. The algorithm works well for inner most loops. However, for general acyclic code, external boundaries do not exist. As a result, the hyperblocks tend to grow along particular paths of control. New technique (PHG is used) to form efficient hyperblocks in acyclic code will increase the effectiveness of hyperblock techniques across all the bench marks.
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.
