Abstract
In this paper, we propose a novel algorithm for merging branches in VLIW and superscalar architectures employing multi-way branch mechanisms. The branch merging problem is to find sets of branches that, can be merged and executed concurrently. The advantages of using branch merging are: (1) to reduce the number of stalls due to branches and (2) to enlarge the size of basic blocks. We show that the general branch merging problem is NP-complete, and then propose a heuristic algorithm to solve this problem.
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.
