Computing lower bounds on functional units before scheduling

  title={Computing lower bounds on functional units before scheduling},
  author={Samit Chaudhuri and Robert A. Walker},
This paper presents a new algorithm for computing lower bounds on the number of functional units (FU's) required to schedule a data ow graph in a speci ed number of control steps. We use a formal approach to compute the bounds that can 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 FU's is used to generate resource constraints for a design… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS
27 Citations
3 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 27 extracted citations


Publications referenced by this paper.
Showing 1-3 of 3 references

Similar Papers

Loading similar papers…