Title :
List scheduling: alone, with foresight, and with lookahead
Author :
Beaty, Steven J.
Author_Institution :
Cray Comput. Corp., Colorado Springs, CO, USA
Abstract :
List scheduling is a popular method of scheduling. It has the benefits of being a relatively fast technique and producing good results. It has weaknesses when dealing with restricted timing. Two ancillary methods, foresight and lookahead, have been developed to help mitigate this weakness. This paper compares the effectiveness of list scheduling alone, with foresight, and with lookahead. It also shows the benefits of lookahead are accrued with no time overhead
Keywords :
parallel programming; processor scheduling; foresight; instruction scheduling; list scheduling; lookahead; processor scheduling; Clocks; Delay; Drives; Processor scheduling; Rockets; Springs; Timing;
Conference_Titel :
Massively Parallel Computing Systems, 1994., Proceedings of the First International Conference on
Conference_Location :
Ischia
Print_ISBN :
0-8186-6322-7
DOI :
10.1109/MPCS.1994.367017
