Sciweavers

Share
MICRO
1995
IEEE

SPAID: software prefetching in pointer- and call-intensive environments

9 years 1 months ago
SPAID: software prefetching in pointer- and call-intensive environments
Software prefetching, typically in the context of numericor loop-intensive benchmarks, has been proposed as one remedy for the performance bottleneck imposed on computer systems by the cost of servicing cache misses. This paper proposes a new heuristic–SPAID–for utilizing prefetch instructions in pointer- and call-intensive environments. We use trace-driven cache simulation of a number of pointer- and call-intensive benchmarks to evaluate the benefits and implementation trade-offs of SPAID. Our results indicate that a significant proportion of the cost of data cache misses can be eliminated or reduced with SPAID without unduly increasing memory traffic.
Mikko H. Lipasti, William J. Schmidt, Steven R. Ku
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 1995
Where MICRO
Authors Mikko H. Lipasti, William J. Schmidt, Steven R. Kunkel, Robert R. Roediger
Comments (0)
books