ILP formulation for data path scheduling problem with conditional branches

In this paper, we present a new time constraint scheduling method for optimizing data paths with conditional branches. In our problem, an operation in the true path for a conditional branch and the other operation in the false path are mutually exclusive, if the branch is activated before both of the operations will be executed, and operations can share a functional unit. The scheduling problem considering mutual exclusiveness is formulated in an integer linear programming (ILP). An optimal scheduling is obtained quickly by an iterating algorithm based on the ILP formulation