A new approach to the multiport memory allocation problem in data path synthesis

DOI10.1016/0167-9260(95)00009-5zbMATH Open0875.68027OpenAlexW2071572298WikidataQ127865128 ScholiaQ127865128MaRDI QIDQ3122507FDOQ3122507

Authors:

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(95)00009-5

Recommendations

• Data path synthesis
• Some new results in the complexity of allocation and binding in data path synthesis
• scientific article; zbMATH DE number 2172810
• A unified approach for scheduling and allocation
• A mathematical model and a metaheuristic approach for a memory allocation problem

zbMATH Keywords

SchedulingAllocationHigh-level synthesisData pathMultiport memory

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07)

Cited In (2)

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

This page was built for publication: A new approach to the multiport memory allocation problem in data path synthesis

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