Foreground memory management in data path synthesis

DOI10.1002/cta.4490200304zbMath0825.68237OpenAlexW1986560568MaRDI QIDQ4014019

Jochen A. G. Jess, Leon Stok

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 complexitymemory managementstoragedata flow graphsdata path synthesis

Mathematics Subject Classification ID

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

Cites Work

• Matrix characterizations of circular-arc graphs
• Unnamed Item
• Unnamed Item

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