An efficient heuristic for code partitioning

DOI10.1016/S0167-8191(99)00110-6zbMATH Open0943.68063OpenAlexW2006691103MaRDI QIDQ1978622FDOQ1978622

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

Recommendations

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

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)

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)