Scheduler optimization by exploring wakeup locality

Kuo Su Hsiao, Chung-Ho Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In a high-performance superscalar processor, the instruction scheduler often comes with poor scalability and high complexity due to the expensive instruction wakeup operation. Using detailed simulation-based analyses, we find that the wakeup distances between two dependent instructions are short. By exploiting this wakeup locality, an effective wakeup design is proposed to improve the speed, power, and scalability of the dynamic scheduler. By limiting the wakeup range of instructions, load capacitance and match activities on the scheduler's critical path can be reduced. The architectural level simulation and circuit-level timing analyses show that the proposed design saves 65-76% of the power consumption, reduces 44-78% in the wakeup latency with negligible (less than 1%) performance degradation. The results also show that the proposed design is excellent in scalability.

Original languageEnglish
Title of host publication2006 International Conference on Computer Engineering and Systems, ICCES'06
Pages115-120
Number of pages6
DOIs
Publication statusPublished - 2006 Dec 1
Event2006 International Conference on Computer Engineering and Systems, ICCES'06 - Cairo, Egypt
Duration: 2006 Nov 52006 Nov 7

Publication series

Name2006 International Conference on Computer Engineering and Systems, ICCES'06

Other

Other2006 International Conference on Computer Engineering and Systems, ICCES'06
CountryEgypt
CityCairo
Period06-11-0506-11-07

All Science Journal Classification (ASJC) codes

  • Computer Science Applications

Fingerprint Dive into the research topics of 'Scheduler optimization by exploring wakeup locality'. Together they form a unique fingerprint.

Cite this