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 language | English |
---|---|
Pages | 193-199 |
Number of pages | 7 |
Publication status | Published - 1996 |
Event | Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN - Beijing, China Duration: 1996 Jun 12 → 1996 Jun 14 |
Other
Other | Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN |
---|---|
City | Beijing, China |
Period | 96/6/12 → 96/6/14 |
ASJC Scopus subject areas
- Computer Science(all)