An efficient heuristic for code partitio
โ
Moez Ayed; Jean-Luc Gaudiot
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 326 KB
In this paper, we propose a heuristic for code partitioning for distributed memory multiprocessors (DMMs). Our method is data-ยฏow based where all levels of parallelism can potentially be exploited. Given a weighted directed acyclic graph (DAG) representation of the program, our partitioning algorith