Title :
Foresighted instruction scheduling under timing constraints
Author :
Allan, Vicki H. ; Su, Bogong ; Wijaya, Pantung ; Wang, Jian
Author_Institution :
Dept. of Comput. Sci., Utah State Univ. Logan, UT, USA
fDate :
9/1/1992 12:00:00 AM
Abstract :
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
Keywords :
graph theory; parallel algorithms; parallel programming; programming theory; scheduling; data dependency graph arcs; data dependency information; foresighted compaction; foresighted instruction scheduling; greedy compaction algorithms; list scheduling; look ahead; maximum timing information; minimum timing information; timing constraints; Compaction; Computer science; Costs; Delay effects; Pipeline processing; Processor scheduling; Registers; Scheduling algorithm; Time factors; Timing;
Journal_Title :
Computers, IEEE Transactions on
