Technique for reduced-tag dynamic scheduling and reduced-tag prediction
US7398375B2 · kind B2 · utility
2Cited by
14References
9Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Apr 3, 2003 |
| Grant date | Jul 8, 2008 |
| Priority date | — |
| Expiry date | Mar 23, 2025 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/3875
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The present invention provides a dynamic scheduling scheme that uses reservation stations having at least one station that stores an at least two operand instruction. An allocator portion determines that the instruction, entering the pipeline, has one ready operand and one not-ready operand, and accordingly places it in a station having only one comparator. The one comparator then compares the not-ready operand with tags broadcasted on a result tag bus to determine when the not-ready operand becomes ready. Once ready, execution is requested to the corresponding functional unit.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.