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.
Copyright © 2014 ISSR Journals. This is an open access article distributed under the Creative Common...
Frequency-Based List Scheduling (FBLS) extends standard List Scheduling by considering execution fre...
For decades combinatorial problems have been studied in numerous disciplines. The scheduling problem...
List scheduling is a popular method of scheduling. It has the benefits of being a relatively fast te...
While altering the scope of instruction scheduling has a rich heritage in compiler literature, instr...
We consider the use of lookahead to minimize the average wait time when scheduling jobs on a sin-gle...
Many approximation results for single machine scheduling problems rely on the conversion of preempti...
Abstract. Many approximation results for single machine scheduling problems rely on the conversion o...
We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular ...
When jobs have to be processed on a set of identical parallel machines so as to minimize the makespa...
textabstractWhen jobs have to be processed on a set of identical parallel machines so as to minimize...
Lookahead is a classic concept in the theory of online scheduling. An online algorithm without looka...
For decades combinatorial problems have been studied in numerous disciplines. The scheduling problem...
While high-performance architectures have included some Instruction-Level Parallelism (ILP) for at l...
Published scheduling algorithms have a fixed complexity. Hence, a range of different scheduling tool...
Copyright © 2014 ISSR Journals. This is an open access article distributed under the Creative Common...
Frequency-Based List Scheduling (FBLS) extends standard List Scheduling by considering execution fre...
For decades combinatorial problems have been studied in numerous disciplines. The scheduling problem...
List scheduling is a popular method of scheduling. It has the benefits of being a relatively fast te...
While altering the scope of instruction scheduling has a rich heritage in compiler literature, instr...
We consider the use of lookahead to minimize the average wait time when scheduling jobs on a sin-gle...
Many approximation results for single machine scheduling problems rely on the conversion of preempti...
Abstract. Many approximation results for single machine scheduling problems rely on the conversion o...
We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular ...
When jobs have to be processed on a set of identical parallel machines so as to minimize the makespa...
textabstractWhen jobs have to be processed on a set of identical parallel machines so as to minimize...
Lookahead is a classic concept in the theory of online scheduling. An online algorithm without looka...
For decades combinatorial problems have been studied in numerous disciplines. The scheduling problem...
While high-performance architectures have included some Instruction-Level Parallelism (ILP) for at l...
Published scheduling algorithms have a fixed complexity. Hence, a range of different scheduling tool...
Copyright © 2014 ISSR Journals. This is an open access article distributed under the Creative Common...
Frequency-Based List Scheduling (FBLS) extends standard List Scheduling by considering execution fre...
For decades combinatorial problems have been studied in numerous disciplines. The scheduling problem...