Approaches to Scheduling
Approaches to Scheduling
(1) Exhaustive Approaches
Ô e.g. EXPL (Barbacci, 1962): exhaustive search, Hafer & Parker: Branch & bound
(2) As-Soon-As-Possible (ASAP)
Ô Used by many pioneering systems (e.g. early CMUDA, MIMOLA, and Flamel)
VLSI ‘91, Edinburgh