By Topic

High-level synthesis scheduling and allocation using genetic algorithms based on constructive topological scheduling techniques

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

2 Author(s)

In this article constructive scheduling methods combined with genetic algorithms are used to search for a suitable order to schedule the operations. The method is extended with an encoding capable of allocating supplementary resources during scheduling. This makes it very suitable in high-level synthesis strategies based on lower bound estimation techniques. Experiments and comparisons show high quality results and fast runtimes that outperform results produced by other heuristic scheduling methods

Published in:

Evolutionary Computation, 1995., IEEE International Conference on  (Volume:1 )

Date of Conference:

Nov. 29 1995-Dec. 1 1995