On the complexity of allocation problems in high-level synthesis

DOI10.1016/0167-9260(94)90002-7zbMATH Open0875.68025OpenAlexW2059443248MaRDI QIDQ4332004FDOQ4332004

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

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

zbMATH Keywords

ColoringAllocation

Mathematics Subject Classification ID

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

Cited In (3)

• The allocation problem in hardware design
• Some new results in the complexity of allocation and binding in data path synthesis
• Title not available (Why is that?)

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)