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

Relative scheduling under timing constraints: algorithms for high-level synthesis of digital circuits

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

2 Author(s)
Ku, D.C. ; Center for Integrated Syst., Stanford Univ., CA, USA ; De Mitcheli, G.

For the synthesis of ASIC design that interface with external signals and events, timing constraints and operations with unbounded delays, i.e. delays unknown at compile time, must be considered. The authors present a relative scheduling formulation that supports operations with fixed and unbounded delays. The start time of an operation is specified in terms of offsets from the set of unbounded delay operations called anchors. The authors analyze a property, called well-posedness, of timing constraints. It is used to identify consistency of constraints in the presence of unbounded delay operations. The authors present an algorithm that will transform an ill-posed constraint graph into a minimally serialized well-posed constraint graph, if one exists. The anchors are then checked for redundancy, and they identify the minimum set of anchors that are required in computing the start time. They present an algorithm that schedules the operations relative to the anchors and yields a minimum schedule that satisfies the timing constraints, or detects whether no schedule exists, in polynomial time. They describe the generation of control logic from the resulting relative schedule

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:11 ,  Issue: 6 )

Date of Publication:

Jun 1992

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.