| 摘要 |
A method, apparatus, and computer instructions for optimizing loops in code during swing modulo scheduling of the code. Nodes in the data dependency graph are given a prioritized ordering for placement, using height/depth as the primary prioritization characteristic. When a node is selected with highest priority based on height/depth the node is then tested to see if it has significant slack, in which case a determination is made if there are any available nodes that lie on the critical path. Nodes from the critical path are thus taken as higher priority than nodes with significant slack, and are placed earlier in the prioritized ordering.
|
