DocumentCode
2888800
Title
A novel integrated scheduling and allocation algorithm for data path synthesis
Author
Kumar, Ajit ; Kumar, Ajit ; Balakrishnan, Mahesh
Author_Institution
Semicond. Complex Ltd., Chandigarh, India
fYear
1991
fDate
4-8 Jan 1991
Firstpage
212
Lastpage
218
Abstract
Proposes a novel integrated scheduling and allocation algorithm suitable for automatic data path synthesis. The algorithm is based on computation of an accurate lower bound on the cost of functional units. The algorithm produces optimal schedules in most cases
Keywords
circuit CAD; scheduling; specification languages; allocation algorithm; data path synthesis; functional units; integrated algorithm; lower bound; optimal schedules; scheduling algorithm; Algorithm design and analysis; Circuits; Cost function; Hardware design languages; High level synthesis; Iterative algorithms; Optimal scheduling; Processor scheduling; Resource management; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI Design, 1991. Proceedings., Fourth CSI/IEEE International Symposium on
Conference_Location
New Delhi
Print_ISBN
0-8186-2125-7
Type
conf
DOI
10.1109/ISVD.1991.185119
Filename
185119
Link To Document