Referenced Items are not available for this document.
An improved transformational approach to the scheduling problem in high-level synthesis is described. Based on an existing approach called SALSA, it uses an extended move set and lower bounds on resource costs to quickly find high-quality schedules of data-oriented control-data flow graphs. Results show the ability to find high-quality schedules for difficult scheduling problems in small amounts of CPU time. Results show that in contrast to other approaches, execution times can actually decrease as schedule length increases
Published in:
Circuits and Systems, 1993., ISCAS '93, 1993 IEEE International Symposium on
Date of Conference: 3-6 May 1993
- Page(s):
- 1678 - 1681 vol.3
- Meeting Date :
- 03 May 1993-06 May 1993
- Print ISBN:
- 0-7803-1281-3
- INSPEC Accession Number:
- 4991496
- Conference Location :
- Chicago, IL
- Digital Object Identifier :
- 10.1109/ISCAS.1993.394064
- 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.
