Eliminating conditional branches for enhancing instruction level parallelism in VLIW compiler

Seong Uk Choi, Sung Soon Park, Myong Soon Park

Research output: Contribution to conferencePaperpeer-review

Abstract

In VLIW (Very Long Instruction Word) compiler, one of the most important issue 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 utilized φ-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.

Original languageEnglish
Pages193-199
Number of pages7
Publication statusPublished - 1996
EventProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN - Beijing, China
Duration: 1996 Jun 121996 Jun 14

Other

OtherProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN
CityBeijing, China
Period96/6/1296/6/14

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Eliminating conditional branches for enhancing instruction level parallelism in VLIW compiler'. Together they form a unique fingerprint.

Cite this