A Complexity-Effective Dynamic Scheduling Algorithm
I found this paper online:
This method uses register renaming along with dependency checking in instruction dispatch to reduce complexity in the wakeup-select logic (reservation stations). A FIFO is setup for each issue slot, instructions are issued to FIFOs so that dependency chains are located in FIFOs. This means that instructions only need to be checked at the head of the FIFO if they are ready to be dispatched to a function unit.
This could greatly reduce the cycle-time and resources used by the scheduler in an FPGA CPU.