The Heuristics: Algorithm
1.
initialize the list of schedule operations
LSO
with the empty set
2.
initialize the list of candidate operations
LCO
with the set of input operations
3. while
the set of candidate operations is not empty
do
3.1.
compute the scheduling pressure for each candidate operation and keep the first
K+1
results
3.2.
select the best candidate operation maximizing the schedule pressure
3.3.
schedule the selected operation on the
K+1
processors selected at step
3.1
; the main processor is the one having the minimum
3.4.
add the scheduled operation to
LSO
and remove it from
LCO
3.5.
add the successors of the scheduled operation to
LCO
4. end while
15 / 28
