315 search results - page 2 / 63 » Improving Performance by Branch Reordering |
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Genetic algorithms have been successfully applied to many difficult problems but there have been some disappointing results as well. In these cases the choice of the internal repre...
FLAIRS
2001
13 years 6 months ago
2001
In this paper, we argue that KBS validation should not be limited to testing functional properties of the system, such as its input - output behavior, but must also address its dy...
ICS
1999
Tsinghua U.
13 years 9 months ago
1999
Tsinghua U.
The performance of irregular applications on modern computer systems is hurt by the wide gap between CPU and memory speeds because these applications typically underutilize multi-...
HIPEAC
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
SIGMETRICS
2011
ACM
12 years 8 months ago
2011
ACM
Branch taken rate and transition rate have been proposed as metrics to characterize the branch predictability. However, these two metrics may misclassify branches with regular his...