Extended 0/1 LP formulation for the scheduling problem in high-level synthesis

Abstract

An extended zero-one linear programming (O/1 LP) model for the scheduling problem in high-level synthesis is presented. As an extension to former approaches, the 0/1 LP model can handle multifunctional function units as well as different execution times for different instances of the same operation type. These extensions are very important for the applicability of general high-level synthesis tools in real design tasks. The computing time for solving the optimization problems is also acceptable for the new powerful model, since new lower bounds have been introduced that drastically reduce the search space. Some experimental results are shown.<>