DocumentCode :
2704017
Title :
Bounding algorithms for design space exploration
Author :
Chaudhuri, Samit ; Walker, Robert A.
Author_Institution :
Magma Design Autom., Palo Alto, CA, USA
fYear :
1999
fDate :
4-6 Mar 1999
Firstpage :
234
Lastpage :
235
Abstract :
This paper describes several new algorithms for computing lower bounds on the length of the schedule and the number of functional units in high-level synthesis
Keywords :
high level synthesis; processor scheduling; bounding algorithms; design space exploration; functional units; high-level synthesis; Algorithm design and analysis; Clocks; Data flow computing; Delay; Flow graphs; High level synthesis; Processor scheduling; Scheduling algorithm; Space exploration; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
VLSI, 1999. Proceedings. Ninth Great Lakes Symposium on
Conference_Location :
Ypsilanti, MI
ISSN :
1066-1395
Print_ISBN :
0-7695-0104-4
Type :
conf
DOI :
10.1109/GLSV.1999.757420
Filename :
757420
Link To Document :
بازگشت