๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient heuristic algorithm for selecting projects

โœ Scribed by Nazim U. Ahmed; Jatinder N.D. Gupta

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
354 KB
Volume
12
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient heuristic for code partitio
An efficient heuristic for code partitioning
โœ 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