In high-level synthesis

trade-off of speed and cost is decided by scheduling

which is an NP-complete problem

In this paper

it is regarded as a multi criteria problem

An algorithm based on the maximum utility-ratio of the function units is put forword

Using this algorithm

optimal or near optimal solution can be gained with lower computing complexity

It can solve not only the problem under the time constraints

but also that under the cost contraints.