Sciweavers

315 search results - page 4 / 63
» Improving Performance by Branch Reordering
Sort
View
ICS
2009
Tsinghua U.
13 years 5 months ago
Creating artificial global history to improve branch prediction accuracy
Modern processors require highly accurate branch prediction for good performance. As such, a number of branch predictors have been proposed with varying size and complexity. This ...
Leo Porter, Dean M. Tullsen
ACL
2009
13 years 5 months ago
Handling phrase reorderings for machine translation
We propose a distance phrase reordering model (DPR) for statistical machine translation (SMT), where the aim is to capture phrase reorderings using a structure learning framework....
Yizhao Ni, Craig Saunders, Sándor Szedm&aac...
IJCOMSYS
2006
82views more  IJCOMSYS 2006»
13 years 7 months ago
Reorder notifying TCP (RN-TCP) with explicit packet drop notification (EPDN)
Abstract. Numerous studies have shown that packet reordering is common, especially in networks where there is high degree of parallelism and different link speeds. Reordering of pa...
Arjuna Sathiaseelan, Tomasz Radzik
SC
2000
ACM
13 years 12 months ago
Improving Fine-Grained Irregular Shared-Memory Benchmarks by Data Reordering
We demonstrate that data reordering can substantially improve the performance of fine-grained irregular sharedmemory benchmarks, on both hardware and software shared-memory syste...
Y. Charlie Hu, Alan L. Cox, Willy Zwaenepoel
ISPASS
2009
IEEE
14 years 2 months ago
Experiment flows and microbenchmarks for reverse engineering of branch predictor structures
Insights into branch predictor organization and operation can be used in architecture-aware compiler optimizations to improve program performance. Unfortunately, such details are ...
Vladimir Uzelac, Aleksandar Milenkovic