The combination of scheduling, allocation, and mapping in a single algorithm
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
VLSI and Modern Signal Processing
VLSI and Modern Signal Processing
High-level synthesis of digital circuits using global scheduling and binding algorithms
High-level synthesis of digital circuits using global scheduling and binding algorithms
Allocation and Binding in Data Path Synthesis Using a Genetic Algorithm Approach
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
AWA*-a window constrained anytime heuristic search algorithm
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Contract Search: Heuristic Search under Node Expansion Constraints
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
| Hi-index | 0.00 |
In this paper, we present a novel heuristic search based approach (VITAL) to Data Path Synthesis. The approach is flexible as it is based on a generalized heuristic search algorithm and is capable of trading off between the solution quality and the computation time. The search algorithms are based on computation of cost estimates which are lower bound on the achievable cost. The approach achieves a higher degree of integration compared to other approaches, and provides closer cost estimates by performing allocation and partial binding sub-tasks during scheduling. It supports a variety of design styles, design constraints and component types, resulting in a versatile system. Experiments on several existing benchmark designs show that even VITAL-NS, which follows strictly one path in the search tree, gives excellent results.