DocumentCode
1025613
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
Volume
41
Issue
9
fYear
1992
fDate
9/1/1992 12:00:00 AM
Firstpage
1169
Lastpage
1172
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;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.165397
Filename
165397
Link To Document