Abstract
Scheduling is a very important step in high-level synthesis. Integer Programming (IP) approach was successfully used to solve the scheduling problem, but it suffers from its restricted mathematical model. Constraint Logic Programming (CLP) was also proposed as a solution technique. Although its flexible model, CLP suffers from high runtimes in large problems. The objective of this paper is to compare the two approaches and to present a hybrid approach that use complementary strengths of Integer Programming (IP) and Constraint Logic Programming (CLP). These approaches were applied to fifth order elliptic wave filter to solve scheduling with module selection problem and the results show the effectiveness of the proposed hybrid approach.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call