An efficient heuristic for code partitioning

DOI10.1016/S0167-8191(99)00110-6zbMath0943.68063OpenAlexW2006691103MaRDI QIDQ1978622

Jean-Luc Gaudiot, Moez Ayed

Publication date: 4 June 2000

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

Full work available at URL: https://doi.org/10.1016/s0167-8191(99)00110-6

zbMATH Keywords

partitioncritical pathtask clusteringtask graphtaskdirected acyclic graph (DAG)task mergingdistributed memory multiprocessor (DMM)processing element (PE)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer system organization (68M99)

This page was built for publication: An efficient heuristic for code partitioning