Data path synthesis

DOI10.1016/0167-9260(94)90011-6zbMATH Open0875.68026OpenAlexW2045498769MaRDI QIDQ4331996FDOQ4331996

Authors: Leon Stok 

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)90011-6

Recommendations

• Some new results in the complexity of allocation and binding in data path synthesis
• A new approach to the multiport memory allocation problem in data path synthesis
• scientific article; zbMATH DE number 49578
• Assignment and allocation of highly testable data paths under scan optimization
• scientific article; zbMATH DE number 3871202

zbMATH Keywords

Register allocationArchitectural synthesisData path allocationHigh level synthesisModule allocationStorage grouping

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Cited In (6)

• A neural networks algorithm for data path synthesis.
• Some new results in the complexity of allocation and binding in data path synthesis
• A unified approach for scheduling and allocation
• The complexity of multidimensional periodic scheduling
• A new approach to the multiport memory allocation problem in data path synthesis
• The datapath merging problem in reconfigurable systems

This page was built for publication: Data path synthesis

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