315 search results - page 3 / 63 » Improving Performance by Branch Reordering |
ICIAR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. It is well-known that the lossless compression of color-indexed images can be improved if a suitable reordering of the palette is performed before encoding the images. In...
ISCA
1995
IEEE
13 years 9 months ago
1995
IEEE
Modern high-performance architectures require extremely accurate branch prediction to overcome the performance limitations of conditional branches. We present a framework that cat...
HSNMC
2003
Springer
13 years 11 months ago
2003
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...
IALP
2009
13 years 3 months ago
2009
Hierarchical phrase-based translation model has been proven to be a simple and powerful machine translation model. However, due to the computational complexity constraints, the ext...
ICCS
2009
Springer
14 years 9 days ago
2009
Springer
Irregular and sparse scientific computing programs frequently experience performance losses due to inefficient use of the memory system in most machines. Previous work has shown t...