Cart (Loading....) | Create Account
Close category search window
 

CASCH-a scheduling algorithm for `high level'-synthesis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gutberlet, P. ; Comput. Sci. Res. Center, Karlsruhe Univ., Germany ; Kramer, H. ; Rosenstiel, W.

It is the goal of the recently developed and herewith presented scheduling algorithm to optimize the timing behaviour within automated circuit synthesis. The algorithm is a part of the CADDY-synthesis-system (CAddy SCHeduling). The basis is a list scheduling algorithm which is controlled by a heuristic rating function. The allocated resources can be modelled in a flexible and detailed manner in order to specify component types for several different operations as well as different component types for the same operation. It is a special feature of this scheduling algorithm that the assignment of operations to component types is decided during the scheduling

Published in:

Design Automation. EDAC., Proceedings of the European Conference on

Date of Conference:

25-28 Feb 1991

Need Help?


IEEE Advancing Technology for Humanity 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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.