The allocation problem in hardware design
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4197386
- On the complexity of allocation problems in high-level synthesis
- Optimal allocation of requirements to parallel devices
- Algorithmic aspects for multiple-choice hardware/software partitioning
- scientific article; zbMATH DE number 544186
- scientific article; zbMATH DE number 3867057
- scientific article; zbMATH DE number 515940
- An Optimal Design Problem for Limited Processor Sharing Systems
- Combinatorial Problems in Chip Design
Cites work
- scientific article; zbMATH DE number 3482375 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3592938 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A better performance guarantee for approximate graph coloring
- Efficient algorithms for interval graphs and circular-arc graphs
- Improving the performance guarantee for approximate graph coloring
- On a property of the class of n-colorable graphs
- Parallel program schemata
- Processor optimization for flow graphs
- Some simplified NP-complete graph problems
- The Rectilinear Steiner Tree Problem is NP-Complete
Cited in
(8)- Some new results in the complexity of allocation and binding in data path synthesis
- On the complexity of allocation problems in high-level synthesis
- scientific article; zbMATH DE number 598111 (Why is no real title available?)
- The pin redistribution problem in multi-chip modules
- Transfer flow graphs
- Register loading via linear programming
- scientific article; zbMATH DE number 3922353 (Why is no real title available?)
- Allocation of Chips to Wafers in a Production Problem of Semiconductor Kits
This page was built for publication: The allocation problem in hardware design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801667)