This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Proceedings of The 26th EUROMICRO Conference (EUROMICRO'00) Volume I-Volume 1
Multi-Objective Genetic Scheduling Algorithm with Respect to Allocation in High-Level Synthesis
Maastricht, The Netherlands
September 05-September 07
ISBN: 0-7695-0780-8
Gregor Papa, Jo?ef Stefan Institute
Jurij ?ilc, Jo?ef Stefan Institute
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.
Citation:
Gregor Papa, Jurij ?ilc, "Multi-Objective Genetic Scheduling Algorithm with Respect to Allocation in High-Level Synthesis," euromicro, vol. 1, pp.1339, Proceedings of The 26th EUROMICRO Conference (EUROMICRO'00) Volume I-Volume 1, 2000
Usage of this product signifies your acceptance of the Terms of Use.