Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Runahead

Runahead is a technique that allows a microprocessor to pre-process instructions during cache miss cycles instead of stalling. The pre-processed… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Runahead execution pre-executes the application's own code to generate new cache misses. This pre-execution results in prefetch… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2010
2010
Runahead Threads (RaT) is a promising solution that enables a thread to speculatively run ahead and prefetch data instead of… Expand
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • table 1
Is this relevant?
2010
2010
After many years of prefetching research, most commercially available systems support only two types of prefetching: software… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
High-performance processors tolerate latency using out-of-order execution. Unfortunately, today's processors are facing memory… Expand
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
Is this relevant?
2006
2006
Today's high-performance processors face main-memory latencies on the order of hundreds of processor clock cycles. As a result… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Runahead execution is a technique that improves processor performance by pre-executing the running application instead of… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2005
2005
While runahead execution is effective at parallelizing independent long-latency cache misses, it is unable to parallelize… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2005
2005
Previous research on runahead execution took it for granted as a prefetch-only technique. Even though the results of instructions… Expand
  • figure 1
  • figure 3
  • figure 2
  • table II
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The performance of memory-bound commercial applications such as databases is limited by increasing memory latencies. In this… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Today's high performance processors tolerate long latency operations by means of out-of-order execution. However, as latencies… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?