By Topic

Eliminating conditional branches for enhancing instruction level parallelism in VLIW compiler

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Seong-Uk Choi ; Dept. of Comput. Sci., Korea Univ., Seoul, South Korea ; Sung-Soon Park ; Myong-Soon Park

In VLIW (Very Long Installation Word) compilers, one of the most important issues is how to handle conditional branches, because control dependences are caused by conditional branches and limit the scope of scheduling. This paper proposes the efficient method of eliminating conditional branches. We use SSA (Static Single Assignment) information for preserving semantics. By using our methods, global scheduling techniques can be processed more efficiently and simply. We utilize φ-functions aggressively, thus computations for code motion are not required. We don't need complex hardware support. Our scheme also makes the performance independent on the result of branch outcomes

Published in:

Parallel Architectures, Algorithms, and Networks, 1996. Proceedings., Second International Symposium on

Date of Conference:

12-14 Jun 1996