Issue No.09 - September (1992 vol.41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.165397
<p>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.</p>
foresighted instruction scheduling; minimum timing information; foresighted compaction; timing constraints; data dependency graph arcs; data dependency information; maximum timing information; list scheduling; look ahead; greedy compaction algorithms; graph theory; parallel algorithms; parallel programming; programming theory; scheduling.
B. Su, V.H. Allan, J. Wang, "Foresighted Instruction Scheduling Under Timing Constraints", IEEE Transactions on Computers, vol.41, no. 9, pp. 1169-1172, September 1992, doi:10.1109/12.165397