315 search results - page 51 / 63 » Improving Performance by Branch Reordering |
125
Voted
APVIS
2007
15 years 5 months ago
2007
Graphs are typically visualized as node-link diagrams. Although there is a fair amount of research focusing on crossing minimization to improve readability, little attention has b...
124
Voted
MICRO
1998
IEEE
15 years 8 months ago
1998
IEEE
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of condi...
110
Voted
AAAI
2010
15 years 5 months ago
2010
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
143
Voted
MICRO
2005
IEEE
15 years 9 months ago
2005
IEEE
Conventional processors use a fully-associative store queue (SQ) to implement store-load forwarding. Associative search latency does not scale well to capacities and bandwidths re...
124
Voted
ASPLOS
2010
ACM
15 years 10 months ago
2010
ACM
The behavior of a multithreaded program does not depend only on its inputs. Scheduling, memory reordering, timing, and low-level hardware effects all introduce nondeterminism in t...