A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
This paper presents new results on lower bounds for the scheduling problem in high-level synthesis. While several techniques exist for lower bound estimation, comparisons among the techniques have been experimental with few guarantees on the quality of the bounds. In this paper, we present new bounds and a theoretical comparison of these with existing bounds. For the resourceconstrained scheduling problem, we present a new algorithm which generalizes the bounding techniques of Langevin anddoi:10.1145/337292.337573 dblp:conf/dac/NarasimhanR00 fatcat:qtlljrjdkrfmvav6e4wgy74wtu