By Topic

Zone scheduling

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)
Cheng-Tsung Hwang ; Dept. of Comput. Sci., California Univ., Riverside, CA, USA ; Yu-Chin Hsu

A technique for the resource constrained scheduling problem in high level synthesis is presented. The approach works by successively partitioning the control steps into zones and solving each of them by a 0.1 integer linear programming (ILP) technique. By specifying the maximum, number of 0-1 variables involved within a zone, the model can be turned into optimal ILP scheduling, list scheduling, or something in between with different speed/quality characteristics. Experiments show that better results than those achieved by list scheduling have been obtained with an acceptable computation overhead

Published in:

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