Referenced Items are not available for this document.
Most scheduling algorithms in high level synthesis are greedy in nature and hence are vulnerable to local minimums in the design space. A novel scheduling algorithm is presented based on simulated evolution which incorporates probabilistic uphill moves to escape from local minimums. This algorithm uses local heuristics and simple cost functions, and relies on rapid iterations and effective design space exploration to obtain superior designs
Published in:
Circuits and Systems, 1990., Proceedings of the 33rd Midwest Symposium on
Date of Conference: 12-14 Aug 1990
- Page(s):
- 172 - 175 vol.1
- Meeting Date :
- 12 Aug 1990-14 Aug 1990
- Print ISBN:
- 0-7803-0081-5
- INSPEC Accession Number:
- 4132173
- Conference Location :
- Calgary, Alta.
- Digital Object Identifier :
- 10.1109/MWSCAS.1990.140679
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
