Foresighted instruction scheduling under timing constraints
Vicki H. Allan, Bin Su, P. Wijaya, Junmian Wang · IEEE Transactions on Computers · 1992
When data dependency graph arcs representing data dependency information are annotated with minimum and maximum timing information, new algorithms are required. Foresighted compaction is a list scheduling technique in which look ahead is used in making decisions. Foresighted compaction is very effective in reducing, failure inherent in greedy compaction algorithms.>