Computing lower bounds on functional units before scheduling
Chaudhuri, S.
Walker, R.A.
Dept. of Electr., Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY;
This paper appears in: High-Level Synthesis, 1994., Proceedings of the Seventh International Symposium on
Publication Date: 18-20 May 1994
On page(s): 36-41
Meeting Date: 05/18/1994 - 05/20/1994
Location: Niagara-on-the-Lake, Ont., Canada
ISBN: 0-8186-5785-5
References Cited: 8
INSPEC Accession Number: 4706376
Digital Object Identifier: 10.1109/ISHLS.1994.302344
Current Version Published: 2002-08-06
Abstract
Presents a new algorithm for computing lower bounds on the number
of functional units (FUs) required to schedule a data flow graph in a
specified number of control steps. We use a formal approach to compute
the bounds that can be proven to be tighter than those produced by
existing methods, and that considers the interdependencies of the bounds
on the different FU-types. This quick, yet accurate estimation of the
number of FUs is used to generate resource constraints for a design, and
thus reduce the design space
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
