Referenced Items are not available for this document.
This paper presents a resource-constrained scheduling algorithm for hierarchical behavioral specifications containing nested loops. The algorithm attempts to share resources across levels, to schedule operations that belong to different levels of the nested loop structures in the specifications as well as operations that belong to the same level. We compare the results of scheduling using our algorithm with those obtained using traditional list scheduling with no sharing of resources among different levels of the specification. These results show an average improvement of 23.47% in terms of number of control steps
Published in:
VLSI, 1999. Proceedings. Ninth Great Lakes Symposium on
Date of Conference: 4-6 Mar 1999
- Page(s):
- 140 - 143
- Meeting Date :
- 04 Mar 1999-06 Mar 1999
- ISSN :
- 1066-1395
- Print ISBN:
- 0-7695-0104-4
- INSPEC Accession Number:
- 6370598
- Conference Location :
- Ypsilanti, MI
- Digital Object Identifier :
- 10.1109/GLSV.1999.757396
- 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.
