Foreground memory management in data path synthesis

DOI10.1002/CTA.4490200304MaRDI QIDQ4014019zbMATH OpenOpenAlexFDO

Authors Leon Stok, Jochen A. G. Jess

Publication date 4 October 1992

Published in International Journal of Circuit Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cta.4490200304

zbMATH Keywords

computational complexitydata flow graphsdata path synthesismemory managementstorage

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3797174 (Why is no real title available?)
• Matrix characterizations of circular-arc graphs

This page was built for publication: Foreground memory management in data path synthesis

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