Multi-Objective Genetic Scheduling Algorithm with Respect to Allocation in High-Level Synthesis

Proceedings of The 26th EUROMICRO Conference (EUROMICRO'00) Volume I-Volume 1 p. 1339
Multi-Objective Genetic Scheduling Algorithm with Respect to Allocation in High-Level Synthesis
Gregor Papa, Jožef Stefan Institute
Jurij Silc, Jožef Stefan Institute

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EURMIC.2000.874651
Send link to a friend

Abstract
In this paper the Multi-Objective Genetic Scheduling (MOGS) algorithm is presented. It is used in high-level synthesis for operation scheduling and allocation. It is a scheduling algorithm, but due to some additional criterions, it is able to produce the schedule, which is optimal 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 out that the MOGS algorithm made the best solutions in all tests and is therefore very appropriate for use in high-level synthesis.
Back to Top Additional Information
Citation: Gregor Papa, Jurij Silc, "Multi-Objective Genetic Scheduling Algorithm with Respect to Allocation in High-Level Synthesis," euromicro, p. 1339, Proceedings of The 26th EUROMICRO Conference (EUROMICRO'00) Volume I-Volume 1, 2000

	Advanced Search
CS Search Google Search