By Topic

Multi-objective genetic scheduling algorithm with respect to allocation in high-level 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
$33 $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)
G. Papa ; Comput. Syst. Dept., Jozef Stefan Inst., Ljubljana, Slovenia ; J. Silc

The Multi-Objective Genetic Scheduling (MOGS) algorithm is presented. It is used in high-level synthesis for operation scheduling and allocation. Basically it is a scheduling algorithm, but due to some additional criteria it is able to produce an optimal schedule for the process of allocation. In other words, it prepares the data-flow graph to be allocated easier, faster and more efficiently. The algorithm is also compared with other algorithms through the evaluation of schedules of various graphs. We found that the MOGS algorithm made the best solutions in all tests and is therefore very appropriate for use in high-level synthesis

Published in:

Euromicro Conference, 2000. Proceedings of the 26th  (Volume:1 )

Date of Conference:

2000