On the complexity of allocation problems in high-level synthesis

DOI10.1016/0167-9260(94)90002-7MaRDI QIDQ4332004zbMATH OpenOpenAlexFDO

Authors Klaus Jansen

Publication date 27 February 1997

Published in Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-9260(94)90002-7

zbMATH Keywords

AllocationColoring

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 598111
• scientific article; zbMATH DE number 19351
• An approximation algorithm for the register allocation problem
• The allocation problem in hardware design
• Processor optimization for flow graphs

Cited in

(5)

• Some new results in the complexity of allocation and binding in data path synthesis
• The allocation problem in hardware design
• A unified approach for scheduling and allocation
• scientific article; zbMATH DE number 598111 (Why is no real title available?)
• scientific article; zbMATH DE number 4197386 (Why is no real title available?)

This page was built for publication: On the complexity of allocation problems in high-level synthesis

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