Sciweavers

ISCA
2008
IEEE

Achieving Out-of-Order Performance with Almost In-Order Complexity

13 years 11 months ago
Achieving Out-of-Order Performance with Almost In-Order Complexity
There is still much performance to be gained by out-of-order processors with wider issue widths. However, traditional methods of increasing issue width do not scale; that is, they drastically increase design complexity and power requirements. This paper introduces the braid, a compile-time identified entity that enables the execution core to scale to wider widths by exploiting the small fanout and short lifetime of values produced by the program. Braid processing requires identification by the compiler, minor extensions to the ISA, and support by the microarchitecture. The result from processing braids is performance within 9% of a very aggressive conventional out-of-order microarchitecture with almost the complexity of an in-order implementation.
Francis Tseng, Yale N. Patt
Added 31 May 2010
Updated 31 May 2010
Type Conference
Year 2008
Where ISCA
Authors Francis Tseng, Yale N. Patt
Comments (0)