An efficient heuristic for code partitioning

DOI10.1016/S0167-8191(99)00110-6MaRDI QIDQ1978622zbMATH OpenOpenAlexFDO

Authors 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

partitiontask clusteringtask graphtaskcritical pathdirected 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)

Recommendations

• Analysis of a heuristic for code partitioning
• scientific article; zbMATH DE number 177834
• scientific article; zbMATH DE number 42110
• scientific article; zbMATH DE number 927047

Cited in

(1)

• Low-complex dynamic programming algorithm for hardware/software partitioning

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

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