Select-free instruction scheduling logic

被引:33
作者
Brown, MD [1 ]
Stark, J [1 ]
Patt, YN [1 ]
机构
[1] Univ Texas, Dept Elect & Comp Engn, Austin, TX 78712 USA
来源
34TH ACM/IEEE INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE, MICRO-34, PROCEEDINGS | 2001年
关键词
D O I
10.1109/MICRO.2001.991119
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 non critical, 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.
引用
收藏
页码:204 / 213
页数:10
相关论文
共 13 条
[1]  
[Anonymous], 2001, DESIGN HIGH PERFORMA
[2]  
CANAL R, 2000, P 14 INT C SUP, P327
[3]  
FARRELL J, 1998, IEEE J SOLID STATE C, V33
[4]  
Henry DS, 2000, PROCEEDING OF THE 27TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, P236, DOI [10.1109/ISCA.2000.854394, 10.1145/342001.339689]
[5]  
HINTON G, 2001, INTEL TECHNICAL FEB
[6]  
*INT CORP, 2001, IA 32 INT ARCH SOFTW, V1
[7]   Data-flow prescheduling for large instruction windows in out-of-order processors [J].
Michaud, P ;
Seznec, A .
HPCA: SEVENTH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTING ARCHITECTURE, PROCEEDINGS, 2001, :27-36
[8]  
MORANCHO E, 2001, P 2001 ACM IEEE INT
[9]   Superscalar execution with dynamic data forwarding [J].
Onder, S ;
Gupta, R .
1998 INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES, PROCEEDINGS, 1998, :130-135
[10]  
PALACHARLA S, 1997, P 24 ANN INT S COMP