315 search results - page 1 / 63 » Improving Performance by Branch Reordering |
PLDI
1998
ACM
13 years 9 months ago
1998
ACM
The conditional branch has long been considered an expensive operation. The relative cost of conditional branches has increased as recently designed machines are now relying on de...
ASPLOS
1994
ACM
13 years 9 months ago
1994
ACM
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...
HSNMC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Numerous studies have shown that packet reordering is common, especially in high speed networks where there is high degree of parallelism and different link speeds. Reor...
IEEEPACT
2000
IEEE
13 years 9 months ago
2000
IEEE
Branch prediction accuracy is a very important factor for superscalarprocessor performance. The ability topredict the outcome of a branch allows the processor to effectively use a...
EMNLP
2007
13 years 6 months ago
2007
Reordering model is important for the statistical machine translation (SMT). Current phrase-based SMT technologies are good at capturing local reordering but not global reordering...