Title :
Computing lower bounds on functional units before scheduling
Author :
Chaudhuri, Samit ; Walker, Robert A.
Author_Institution :
Dept. of Electr., Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA
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
Keywords :
computational complexity; graph theory; logic design; parallel processing; scheduling; bound interdependencies; control steps; data flow graph; design space reduction; formal approach; functional units; lower bounds; resource constraints; scheduling; Algorithm design and analysis; Computer science; Data flow computing; Design engineering; Flow graphs; Heuristic algorithms; Processor scheduling; Scheduling algorithm; Strain control; Systems engineering and theory;
Conference_Titel :
High-Level Synthesis, 1994., Proceedings of the Seventh International Symposium on
Conference_Location :
Niagara-on-the-Lake, Ont.
Print_ISBN :
0-8186-5785-5
DOI :
10.1109/ISHLS.1994.302344
