Genetic algorithms and instruction scheduling
Steven J. Beaty · 1991
Many difficulties are encountered when developing an instruction scheduler to produce efficacious code for multiple architectures.Heuristic-based methods were found to produce disappointing results; indeed the goals of validity and length compete.This lead to the introduction of another method to search the solution space of valid schedules: genetic algorithms.Their application to this domain proved fruitful.