Sciweavers

315 search results - page 5 / 63
» Improving Performance by Branch Reordering
Sort
View
MICRO
1994
IEEE
118views Hardware» more  MICRO 1994»
13 years 11 months ago
Characterizing the impact of predicated execution on branch prediction
Branch instructions are recognized as a major impediment to exploiting instruction level parallelism. Even with sophisticated branch prediction techniques, many frequently execute...
Scott A. Mahlke, Richard E. Hank, Roger A. Bringma...
CSL
2011
Springer
13 years 2 months ago
Syntax-based reordering for statistical machine translation
In this paper we address the problem of translating between languages with word order disparity. The idea of augmenting statistical machine translation (SMT) by using a syntax-bas...
Maxim Khalilov, José A. R. Fonollosa
GECCO
2003
Springer
14 years 21 days ago
Problem-Independent Schema Synthesis for Genetic Algorithms
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...
Yong-Hyuk Kim, Yung-Keun Kwon, Byung Ro Moon
CIKM
2008
Springer
13 years 9 months ago
Transaction reordering with application to synchronized scans
Traditional workload management methods mainly focus on the current system status while information about the interaction between queued and running transactions is largely ignore...
Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Mi...
PLDI
2005
ACM
14 years 1 months ago
Code placement for improving dynamic branch prediction accuracy
Code placement techniques have traditionally improved instruction fetch bandwidth by increasing instruction locality and decreasing the number of taken branches. However, traditio...
Daniel A. Jiménez