Scheduling algorithm in data path synthesis using the Tabu search technique

A model in integer linear programming (ILP) for the scheduling problem in the high-level synthesis of digital systems at register transfer level is developed using a new approach based on penalty weights. This approach avoids the inflexibility of the ILP formulations developed in related works where the functional unit performing each type of operation is fixed before scheduling. The Tabu search method was adapted for this purpose. The mathematical formulation developed takes into account almost all the area parameters and allows an unrestricted search in a large space delimited only by the components available in the library used.<
>