Optimum and heuristic data path scheduling under resource constraints

1 January 1990

proceedings article
Published by Association for Computing Machinery (ACM)

p. 65-70
https://doi.org/10.1145/123186.123228

Abstract

[[abstract]]An integer linear programming model for the scheduling problem in high-level synthesis under resource constraints is presented. The following applications are considered: multicycle operations with nonpipelined or pipelined function units; mutually exclusive operations; functional pipelining; loop folding; and scheduling under bus constraint. Besides the model, a new technique, called zone scheduling (ZS), is proposed to solve large-size problems. ZS partitions the distribution graph into several zones and sequentially solves the problems contained. A novel feature of this technique is that it schedules more than one control step at a time, allowing a more global view of a scheduling problem to be taken.[[fileno]]2030207030031[[department]]資訊工程學

This publication has 0 references indexed in Scilit: