By Topic

Heuristic search based approach to scheduling, allocation and binding in Data Path Synthesis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kumar, A. ; Cadence Design Syst. (I) Pvt. Ltd., Noida, India ; Kumar, A. ; Balakrishnan, M.

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

Published in:

VLSI Design, 1995., Proceedings of the 8th International Conference on

Date of Conference:

4-7 Jan 1995