DocumentCode
2010503
Title
Achieving Out-of-Order Performance with Almost In-Order Complexity
Author
Tseng, Francis ; Patt, Yale N.
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Texas, Austin, TX
fYear
2008
fDate
21-25 June 2008
Firstpage
3
Lastpage
12
Abstract
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.
Keywords
computer architecture; program compilers; ISA; almost in-order complexity; braid processing; compile-time identified entity; design complexity; out-of-order performance; power requirements; Bars; Computer architecture; Hardware; Instruction sets; Microarchitecture; Out of order; Performance loss; Pipeline processing; Process design; Processor scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Architecture, 2008. ISCA '08. 35th International Symposium on
Conference_Location
Beijing
ISSN
1063-6897
Print_ISBN
978-0-7695-3174-8
Type
conf
DOI
10.1109/ISCA.2008.23
Filename
4556711
Link To Document