Runahead Execution: An Alternative to Very Large Instruction Windows for Out-of-order Processors
by Onur Mutlu, Jared Stark, Chris Wilkerson, Yale N. Patt
show details
Details
| year: | 2003 | | annote: | Onur Mutlu (ECE; Department; The University of Texas at Austin); Jared Stark (ECE; Department; The University of Texas at Austin); Chris Wilkerson (ECE; Department; The University of Texas at Austin); Yale N. Patt (ECE; Department; The University of Texas at Austin); | | month: | jan # "~17 | | publisher: | IEEE Computer Society | | pages: | 129--140 | | type: | inproceedings | | booktitle: | HPCA | | address: | Anaheim, California, USA | | abstract: | Today's high performance processors tolerate long latency operations by means of out-of-order execution. However, as latencies increase, the size of the instruction window must increase even faster if we are to continue to tolerate these latencies. We have already reached the point where the size of an instruction window that can handle these latencies is prohibitively large, in terms of both design complexity and power consumption. And, the problem is getting worse. This paper proposes runahead execution as an effective way to increase memory latency tolerance in an out-of-order processor, without requiring an unreasonably large instruction window. Runahead execution unblocks the instruction window blocked by long latency operations allowing the processor to execute far ahead in the program path. This results in data being prefetched into caches long before it is needed. On a machine model based on the Intel Pentium 4 processor, having a 128-entry instruction window |
|
|
You need to log in to add tags and post comments.
