Name
Abstract | ||
|---|---|---|
A larger Dynamic Scheduler (DS) exposes more Instruction Level Parallelism (ILP), giving better performance. However, a larger DS also results in a longer scheduler latency and a slower clock speed. In this paper, we propose a new DS design that reduces the scheduler critical path latency by reducing the wakeup width (defined as the effective number of results used for instruction wakeup). The design is based on the realization that the average number of results per cycle that are immediately required to wake up the dependent instructions is considerably less than the processor issue width. Our designs are evaluated using the simulation of the SPEC 2000 benchmarks and SPICE simulations of the actual issue queue layouts in 0.18 micron process. We found that a significant reduction in scheduler latency, power consumption and area is achieved with less than 2% reduction in the Instructions per Cycle (IPC) count for the SPEC2K benchmarks. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/ICCD.2004.1347895 | ICCD |
Keywords | Field | DocType |
effective number,instruction wakeup,new ds design,wakeup width,actual issue queue layout,scheduler latency,larger dynamic scheduler,average number,spec2k benchmarks,larger ds,efficient dynamic scheduling,scheduler critical path latency,instructions per cycle,low power electronics,critical path,microcomputers,dynamic scheduling | Instructions per cycle,Instruction-level parallelism,Fixed-priority pre-emptive scheduling,Latency (engineering),Scheduling (computing),Computer science,Parallel computing,Real-time computing,Critical path method,Dynamic priority scheduling,Clock rate,Embedded system | Conference |
ISSN | ISBN | Citations |
1063-6404 | 0-7695-2231-9 | 10 |
PageRank | References | Authors |
0.50 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aneesh Aggarwal | 1 | 202 | 16.91 |
| Manoj Franklin | 2 | 158 | 11.38 |
| Oguz Ergin | 3 | 424 | 25.84 |