High-Level synthesis scheduling and allocation using genetic algorithms

In this article a scheduling method is presented which is ca-pable of allocating supplementary resources during scheduling. This makes it very suitable in synthesis strategies based on lower bound estimations techniques. The method is based on genetic algorithms. Special coding techniques and analysis methods are used to improve the runtime and quality of the results. The sched-uler can easily be extended to coverother architectural issues and (for example) providesways to make trade-offs between functional unit allocation and register allocation. Experiments and compar-isons show high quality results and fast run times that outperform results produced by other heuristic scheduling methods