High-level synthesis optimisation with genetic algorithms

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The results of a genetic algorithm optimisation of the scheduling and allocation phases of high-level synthesis are reported. Scheduling and allocation are NP complete, multi-objective phases of high-level synthesis. A high-level synthesis system must combine the two problems to produce optimal results. The genetic algorithm described provides a robust and efficient method of search capable of combining scheduling and allocation phases, and responding to the multiple and changing objectives of high-level synthesis. The results show the genetic algorithm succeeds in finding optimal or near optimal results to classic benchmarks in small computational time spans.

Cite

CITATION STYLE

APA

Daalder, J., Eklund, P. W., & Ohmori, K. (1996). High-level synthesis optimisation with genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1114, pp. 276–287). Springer Verlag. https://doi.org/10.1007/3-540-61532-6_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free