loading...
Defining Wakeup Width for Efficient Dynamic Scheduling
San Jose, CA October 11-October 13
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCD.2004.13478952004 IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Aneesh Aggarwal, Binghamton University, NY
Manoj Franklin, University of Maryland, College Park
Oguz Ergin, Binghamton University, NY
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.
Citation:
Aneesh Aggarwal, Manoj Franklin, Oguz Ergin, "Defining Wakeup Width for Efficient Dynamic Scheduling," iccd, pp.36-41, 2004 IEEE International Conference on Computer Design (ICCD'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.