TECHNIQUE FOR REDUCED-TAG DYNAMIC SCHEDULING

摘要

The present invention provides a dynamic scheduling scheme that uses reservation stations (24) having at least one station that stores an at least two operand instruction (20). An allocator portion (12) determines that the instruction (20), entering the pipeline (10), has one ready operand and one not-ready operand, and accordingly places it in a station having only one comparator (42). The one comparator (42) then compares the not-ready operand with tags broadcasted on a result tag bus (30) to determine when the not-ready operand becomes ready. Once ready, execution is requested to the corresponding functional unit (32).