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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Alander, Jarmo T.: An Indexed Bibliography of Genetic Algorithms in Electronics and VLSI Design and Testing. Tech Report, Department of Information Technology and Production Economics, University of Vaasa. 1994
Goldberg, D.E.: Genetic Algorithms in Search, Optimisation, and Machine Learning. Addison-Wesley 1989
IEEE: IEEE Standard VHDL Language Reference Manual. ANSI/IEEE Standard 1076-1993
Ohmori, K.: High-Level Synthesis using Genetic Algorithms. Proceedings on the IEEE Conference on Evolutionary Computing. 1995
Paulin, P.G and Knight, J.P and Girczyc, E.F.: HAL: A multi-paradigm approach to automatic data-path synthesis. Proceedings of the 23rd Design Automation Conference. 1986 236–270
Walker, R.A.: The status of high-level synthesis. IEEE Design and Test of computers. Winter (1994) 42–54
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daalder, J., Eklund, P.W., Ohmori, K. (1996). High-level synthesis optimisation with genetic algorithms. In: Foo, N., Goebel, R. (eds) PRICAI'96: Topics in Artificial Intelligence. PRICAI 1996. Lecture Notes in Computer Science, vol 1114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61532-6_24
Download citation
DOI: https://doi.org/10.1007/3-540-61532-6_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61532-3
Online ISBN: 978-3-540-68729-0
eBook Packages: Springer Book Archive