Sciweavers

Share
MICRO
2002
IEEE

A quantitative framework for automated pre-execution thread selection

11 years 6 months ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated from the main program and launched as separate threads called p-threads whenever the processor anticipates an upcoming miss. P-thread selection is the task of deciding what computations should execute on p-threads and when they should be launched such that total execution time is minimized. P-thread selection is central to the success of pre-execution. We introduce a framework for automated static p-thread selection, a static p-thread being one whose dynamic instances are repeatedly launched during the course of program execution. Our approach is to formalize the problem quantitatively and then apply standard techniques to solve it analytically. The framework has two novel components. The slice tree is a new data structure that compactly represents the space of all possible static p-threads. Aggregate advantage...
Amir Roth, Gurindar S. Sohi
Added 15 Jul 2010
Updated 15 Jul 2010
Type Conference
Year 2002
Where MICRO
Authors Amir Roth, Gurindar S. Sohi
Comments (0)
books