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. >

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call