Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays

DOI10.1007/BF02088008zbMath0659.68078DBLPjournals/mst/ErdosKMSZ88OpenAlexW2051068635WikidataQ59701066 ScholiaQ59701066MaRDI QIDQ3809272

Shmuel Zaks, Israel Koren, Shlomo Moran, Gabriel M. Silberman

Publication date: 1988

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02088008

zbMATH Keywords

VLSIlinear programsdata routingtwo-dimensional systolic arrays

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Discrete mathematics in relation to computer science (68R99)

Cites Work

• Unnamed Item
• Extremal problems on permutations under cyclic equivalence
• Optimal Three-Layer Channel Routing
• The Design of Optimal Systolic Arrays
• Optimal Rotation Problems in Channel Routing

This page was built for publication: Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays