The partitioning of QSDF computation graphs

DOI10.1016/0167-8191(89)90117-8zbMath0667.68037OpenAlexW2021433941MaRDI QIDQ1117692

Israel Gottlieb

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90117-8

zbMATH Keywords

parallel processingmodel of computationdata flow graphcomputation pathsoptimal partitioning of static program structurequasi synchronous data flow

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)

This page was built for publication: The partitioning of QSDF computation graphs