DocumentCode :
2354991
Title :
Select-free instruction scheduling logic
Author :
Brown, Mary D. ; Stark, Jared ; Patt, Yale N.
Author_Institution :
Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA
fYear :
2001
fDate :
1-5 Dec. 2001
Firstpage :
204
Lastpage :
213
Abstract :
Pipelining allows processors to exploit parallelism. Unfortunately, critical loops-pieces of logic that must evaluate in a single cycle to meet IPC (Instructions Per Cycle) goals-prevent deeper pipelining. In today´s processors, one of these loops is the instruction scheduling (wakeup and select) logic [10]. This paper describes a technique that pipelines this loop by breaking it into two smaller loops: a critical, single-cycle loop for wakeup; and a noncritical, potentially multi-cycle, loop for select. For the 12 SPECint*2000 benchmarks, a machine with two-cycle select logic (i.e., three-cycle scheduling logic) using this technique has an average IPC 15% greater than a machine with three-cycle pipelined conventional scheduling logic, and an IPC within 3% of a machine of the same pipeline depth and one-cycle (ideal) scheduling logic. Since select accounts for more than half the scheduling latency [10], this technique could significantly increase clock frequency while having minimal impact on IPC.
Keywords :
instruction sets; parallel architectures; performance evaluation; processor scheduling; SPECint*2000 benchmarks; clock frequency; instruction scheduling; instructions per cycle; pipelining; scheduling latency; select-free instruction scheduling logic; Clocks; Concurrent computing; Delay; Frequency; Logic; Microprocessors; Parallel processing; Pipeline processing; Processor scheduling; Trademarks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Microarchitecture, 2001. MICRO-34. Proceedings. 34th ACM/IEEE International Symposium on
ISSN :
1072-4451
Print_ISBN :
0-7965-1369-7
Type :
conf
DOI :
10.1109/MICRO.2001.991119
Filename :
991119
Link To Document :
بازگشت