Multi-objective genetic scheduling algorithm with respect to allocation in high-level synthesis

The Multi-Objective Genetic Scheduling (MOGS) algorithm is presented. It is used in high-level synthesis for operation scheduling and allocation. Basically it is a scheduling algorithm, but due to some additional criteria it is able to produce an optimal schedule for the process of allocation. In other words, it prepares the data-flow graph to be allocated easier, faster and more efficiently. The algorithm is also compared with other algorithms through the evaluation of schedules of various graphs. We found that the MOGS algorithm made the best solutions in all tests and is therefore very appropriate for use in high-level synthesis.