315 search results - page 10 / 63 » Improving Performance by Branch Reordering |
ACMMSP
2004
ACM
14 years 29 days ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
MICRO
2000
IEEE
13 years 12 months ago
2000
IEEE
Dynamically Linked Libraries (DLLs) promote software modularity, portability, and flexibility and their use has become widespread. In this paper, we characterize the behavior of f...
MICRO
1998
IEEE
13 years 11 months ago
1998
IEEE
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
SIGMETRICS
1998
ACM
13 years 11 months ago
1998
ACM
Modern disk drives read-ahead data and reorder incoming requests in a workload-dependent fashion. This improves their performance, but makes simple analytical models of them inade...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...