Some new results in the complexity of allocation and binding in data path synthesis

DOI10.1016/S0898-1221(98)00076-5MaRDI QIDQ1608404zbMATH OpenFDO

Authors C. A. Mandal, P. P. Chakrabarti, Sujoy Ghose

Publication date 6 August 2002

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

allocationbinding problemsdata path synthesis

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Mathematical problems of computer architecture (68M07)

Recommendations

• Data path synthesis
• On the complexity of allocation problems in high-level synthesis
• A new approach to the multiport memory allocation problem in data path synthesis
• The allocation problem in hardware design
• scientific article; zbMATH DE number 19351

Cites work

• On the hardness of approximating minimization problems
• The complexity of optimization problems

Cited in

(4)

• A neural networks algorithm for data path synthesis.
• A new approach to the multiport memory allocation problem in data path synthesis
• The datapath merging problem in reconfigurable systems
• Data path synthesis

This page was built for publication: Some new results in the complexity of allocation and binding in data path synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608404)