Author :
Hwang, Cheng-Tsung ; Hsu, Yu-Chin
Author_Institution :
Dept. of Comput. Sci., California Univ., Riverside, CA, USA
fDate :
7/1/1993 12:00:00 AM
Abstract :
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
Keywords :
integer programming; linear programming; logic CAD; scheduling; 0.1 integer linear programming; high level synthesis; list scheduling; optimal ILP scheduling; partitioning; resource constrained scheduling problem; speed/quality characteristics; Computer science; Councils; Flow graphs; Integer linear programming; Monitoring; Optimal scheduling; Processor scheduling; Registers; Scheduling algorithm; Synthesizers;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
