Towards a global solution to high level synthesis problems

Since the various tasks as scheduling, operator allocation and module selection involved in the high level synthesis are strongly interdependent, a global solution to the high level synthesis problems becomes necessary. Therefore, a global optimization process which simultaneously performs scheduling, operators allocation and module selection, is presented in this paper. The search for a good solution in a 'realistic enough' design space is made possible thanks to a global optimization algorithm which is simulated-annealing-based and improved by a pseudo-deterministic control. In the absence of other challenging global methods for both scheduling-operator allocation and module selection, the proposed global optimization algorithm is compared to a regular simulated annealing. Experimental results are shown in this paper and highlight a significant speed-up over a regular simulated annealing.<
>