Referenced Items are not available for this document.
Dynamic loop scheduling, an algorithm that can efficiently schedule large, control-flow dominated designs, written in VHDL is presented. It compares favorably with results produced by other control-flow oriented approaches such as path-based scheduling, but avoids the path explosion problem. In addition, the VHDL accepted by the scheduler is quite comprehensive, including nested branches, loops (whose conditions can be compounded), loop exit statements and procedure calls. The algorithm forms an integral part of the AMICAL data-path compiler
Published in:
Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on
Date of Conference: 22-25 Feb 1993
- Page(s):
- 393 - 397
- Meeting Date :
- 22 Feb 1993-25 Feb 1993
- Print ISBN:
- 0-8186-3410-3
- INSPEC Accession Number:
- 4885202
- Conference Location :
- Paris
- Digital Object Identifier :
- 10.1109/EDAC.1993.386444
- 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.
