Integrated resource assignment and scheduling of task graphs using finite domain constraints
DATE '99 Proceedings of the conference on Design, automation and test in Europe
Constraints-driven scheduling and resource assignment
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Synthesis and verification
Time-constrained scheduling of large pipelined datapaths
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
This paper presents a new method for modeling and solving high-level synthesis problem. In our approach, finite domain constraints and related constraints solving techniques offered by constrained logic programming are used. They make it possible to define basic constraints on operations and registers and provide a way to find optimal or suboptimal solutions to the data-path synthesis problem. Different design styles, such as multicycling, chaining, pipelined components and algorithmic pipelining can be modeled in this framework. The proposed formulation combines different constraints in one representation and thus the optimization can find a better solution. The prototype system has been implemented in CHIP, the constraint logic programming system. The extensive experiments carried out using this system has proved the feasibility of the presented approach.